Subject: JAVA [Please solve this in next 10min please] [I'll upvote for your quick answer] 1 //Explain, why this java code will not run and show error23 public class My4 {public static void main(String [] args){ printAll(args); }public static void printAll(String[] lines){for (int i = 0; i < lines.length; i++){ System.out.println(lines[i]);Thread.currentThread ().sleep (1000); }781011}13 }12

public class My { public static void main(String [] args) { printAll(args); } public static void printAll(String[] lines) { for(int i = 0; i < lines.length; i++) { System.out.println(lines[i]);' Thread.currentThread().sleep (1000); }

public class My { public static void main(String [] args) { printAll(args); } public static void printAll(String[] lines) { for(int i = 0; i < lines.length; i++) { System.out.println(lines[i]);' Thread.currentThread().sleep (1000); }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

FOR JAVA WRITE A CLASS BY EXTENDING THREAD AND PRINT OUT THE ODD NUMBERS FROM 1 TILL N
Implement a class that checks whether a given number is a prime numberor not using both the Thread class and Runnable interface.
In the cellular automata, some cells are filled while others are empty. Assume having a Boolean array of values corresponding to filled and empty cells, develop a Java code segment to plot the updated cellular automata assuming cell width and height is c, and the number of cells per row is n and the number of cells per column is n. solve it using Java2d and implement thread or timer in solution
How should I edit my code to achieve the desired output? I wanted to practice using this program but I can't get the output that displays the thread that finished first and last, and also the display "No winner" import java.util.Random;import java.util.Scanner; class prog1 implements Runnable { private String cName = new String(""); private int x; public int c1 = 0, c2 = 0, c3 = 0; public prog1 (String cName, int x){ this.cName = cName; this.x = x; } @Override public void run(){ Random r = new Random(); int randNum; for (int i = 1; i <= this.x; i++){ randNum = r.nextInt(x) + 1; if(i == 3) { System.out.println(" Voter " + i + " " + cName + " = " + randNum + "[Voting is closed]"); } else System.out.println(" Voter " + i + " " + cName + " = " + randNum); if(randNum == 1) c1++; if(randNum == 2) c2++;…
what is the output of the code? Is the code have parallel programming ? Explain in depth about the code given. import java.util.concurrent.RecursiveAction; import java.util.concurrent.ForkJoinPool; import java.util.concurrent.TimeUnit; public class ParallelismDemo1 extends RecursiveAction { final int THRESHOLD = 2; double[] numbers; int indexStart, indexLast; ParallelismDemo1 (double[]n, int s, int l) { numbers = n; indexStart = s; indexLast = l; } protected void compute () { if ((indexLast - indexStart) > THRESHOLD) for (int i = indexStart; i < indexLast; i++) numbers[i] = numbers[i] + Math.random (); else invokeAll (new ParallelismDemo1 (numbers, indexStart, (indexStart - indexLast) / 2), new ParallelismDemo1 (numbers, (indexStart - indexLast) / 2, indexLast)); } public static void main (String[]args) { final int SIZE = 10; ForkJoinPool pool = new ForkJoinPool (); double na[] = new double[SIZE];…
Complete and submit LinkedStack2.java with following: Inherit LinkedStack.java, implement StackInterface2.java Add String toString()method as specified in page 153, problem 28(a) Add int size()method as specified in page 153, problem 28(b) Add void popSome(int count)method as specified in page 153, problem 28(c) Add boolean swapStart()method as specified in page 153, problem 28(d) Add T poptop() method as specified in page 153, problem 28(e)
Please sort out the following JAVA code....line by line. Run the code in Netbeans and provide screenshots to verify that it runs successfully. CODE: import java.io.*; import java.util.*; public class experiment { public static void main(String args[]) { Scanner in=new Scanner(System.in); int time[]=new int[10]; float weight[]=new float[10]; String get; char ch; int i=0; do{ try { System.out.print("\nEnter the time in seconds:"); time[i]=in.nextInt(); System.out.print("\nEnter the weight in kilograms:"); weight[i]=in.nextFloat(); i++; } catch(Exception e) { System.out.print("\nInvalid type"); } System.out.print("\n-----------------"); System.out.print("\n|Time\t|Weight\t|"); System.out.print("\n-----------------"); for(int x=0;x<i;x++) { System.out.print("\n|"+time[x]+"\t|"+weight[x]+"\t|"); System.out.print("\n-----------------"); } if(i==10) { for(int x=0;x<9;x++) { time[x]=time[x+1]; weight[x]=weight[x+1]; } i--; } System.out.print("\nDo you want to continue?(y/n) ");…
using Java, create a virtual shopping store. using the two txt files (items and sale), display a list of items, price and if on sale. have the user select what items they want until they press 'q' to quit. show list of what they purchased, add the total and how much they saved. class BillProcessor {public static void prepareBill(LinkedHashMap<String, Integer> purchases, LinkedHashMap<String,Double>items, LinkedHashMap<String,String> sales, ArrayList<String> itemNames) {total cost = 0total discount = 0for each item in purchases:compute the regular costif item is subject to a sale (i.e. it appears in the sales lhm)determine the sales price if it's bogo - mod operator and the int/intif it's not bogo - apply the discount pricecompute the actual cost based on thattotal cost = total cost + actual costtotal disc = total disc + discountprint a line formatted like the example that summarizes the purchase of that itemprint the summary}} public class KlumpGroceryStore…
Please answer this question- Implement Floyd's algorithm for the Shortest Path on your system, and study its performance using different graphs. Side note- Below I have attached Floyd's Algorithm for Shortest Paths. please use java language for coding java file - should start with your Last Name, Like SmithClubApp, PetrowskiTravelLogApp, for your class short paragraph should include- please label the question with the answer as well -description of the java file -what it does? -what is the input data? expected output, samples of both
help I am trying to make a java program with three threads. two representing client bob and Alice. a third thread representing a mail server. make Alice check their mailbox every 5 second if their is a mail form bob, Alice should send one back and bob should do the same thing. Pre-load Alice's mailbox with one mail from Bob. For the next minute or so, Alice should check for mail every 5 seconds and Bob should check for mail every 3 seconds. If they receive a mail, they should send one back. The body of the first mail should say "Hello", the body of the second mail should say "Hello Hello", and so on. Design a Mail class that has fields From, To, Date, Body. here is what I have but Im lost public class mailserver2 extends Thread{public boolean maildeliverd;public boolean maildeliverbob; public void checkMail(){ try{while (maildeliverd){Thread.sleep(5000); }}catch(Exception e){System.out.print("mail not recieved");}System.out.print("mail recieved");mailclass mc = new…
I. Output of public class Test implements Runnable { public void run() { System.out.println( "running!" ); } public void start( int i ) { } public static void main( String[] args ) { Test t = new Test(); Thread th = new Thread( t ); t.start( 1 ); } } II. Output of public static void main(String[] args) { int[] arr = { 0, 1, 2, 3, 4 }; System.out.println( arr[arr[arr.length-1]] ); } III. System.out.println (“3 in binary Nos=” + “Integer.toBinaryString(3)”); IV. Will the following java code compile? if not why? if yes write the output. abstract class A { abstract void callme(); // concrete methods are still allowed in abstract classes void callmetoo() { System.out.println("This is a concrete method."); } } class B extends A { void callmetoo() { System.out.println("B's implementation of callme."); } } class AbstractDemo { public static void main(String args[]) { B b = new B(); b.callmetoo(); } } } V.…
One method at a time is all that can be executed by a thread on a Java virtual machine (JVM). Can you back up your claims with proof?