Question

Java round robin scheduling algorithm:

10 processes arrive at the same time and the time that each requires is random. Show that the output of the original list and list as it changes all the way until nothing is left in the array. Using only main method and not any additional static methods and Only using scanner, arrays, and for looper while/do while loops. No array lists or other methods in java.

Answer 1

import java.io.*;
import java.util.concurrent.TimeUnit;
import java.util.Random;
class Main
{
public static void main(String args[])throws IOException
{   
int arrayOfProcesses[] = new int[10];
int i = 0;
while (i < 10)
{
try
{
TimeUnit.MILLISECONDS.sleep(100);
}
catch(InterruptedException e)
{
// this part is executed when an exception (in this example InterruptedException) occurs
}
arrayOfProcesses[i] = new Random().nextInt(100);
i++;
}
int initialTotalTimeTaken = 0;
i = 0;
while (i < 10)
{
System.out.println("Initial Time taken by " + i + " process is " + arrayOfProcesses[i] + " milliseconds");
initialTotalTimeTaken += arrayOfProcesses[i];
i++;
}
System.out.println();
i = 0;
while (i < 10)
{
try
{
TimeUnit.MILLISECONDS.sleep(100);
}
catch(InterruptedException e)
{
// this part is executed when an exception (in this example InterruptedException) occurs
}
arrayOfProcesses[i] = new Random().nextInt(70);
i++;
}
int newTotalTimeTaken = 0;
i = 0;
while (i < 10)
{
System.out.println("New Time taken by " + i + " process is " + arrayOfProcesses[i] + " milliseconds");
newTotalTimeTaken += arrayOfProcesses[i];
i++;
}

System.out.println("\nTotal time taken initially by all processes = " + initialTotalTimeTaken + " milliseconds");
System.out.println("Total time taken later by all processes = " + newTotalTimeTaken + " milliseconds");
   }
}