Question

Could you please add Round Robin CPU scheduling algorithm with quantum 10 in this code?

Scheduling.java

import java.util.ArrayList;
import java.util.Random;
import java.util.Scanner;

public class Scheduling {
public static void main(String[] args) {

ArrayList<Proc> pr = new ArrayList<Proc>();
ArrayList<Proc> pr1 = new ArrayList<Proc>();
ArrayList<Proc> pr2 = new ArrayList<Proc>();
ArrayList<Proc> pr3 = new ArrayList<Proc>();
  

int count=0;
Random ran = new Random();
boolean unique=false;
int num=0;


for(int i=0;i<=5;i++){
unique=false;
Proc p1=new Proc();

while(!unique){
num=ran.nextInt(10) + 1;
if(i==0)
break;

for(int j=0;j<i;j++){
if(num==pr.get(j).id){
unique=false;
break;
}
  
else
unique=true;
}
}

p1.id=num;
p1.burstLength=ran.nextInt(10) + 10;
p1.priority=ran.nextInt(10) + 1;
pr.add(p1);
pr2.add(p1);
count++;
}

System.out.println("Process ID | Priority | Burst-length");
for(int i=0;i<count;i++){
System.out.println(pr.get(i).id+" "+pr.get(i).priority+" "+pr.get(i).burstLength);
}

boolean cont=true;
while(cont){

System.out.println("Do you want to add one more process true/false" );
Scanner n = new Scanner(System.in);
cont = n.nextBoolean();
if(cont){

Proc p1=new Proc();
unique=false;
  
while(!unique){
System.out.println("Enter process id" );
num=n.nextInt();
for(int j=0;j<count;j++){
if(num==pr.get(j).id){
unique=false;
break;
}
else
unique=true;
}
}
  
p1.id=num;
System.out.println("Enter process burst length" );
p1.burstLength=n.nextInt();
System.out.println("Enter process priority" );
p1.priority=n.nextInt();
pr2.add(p1);
pr.add(p1);
count++;
}

else
break;

}

System.out.println("Process ID | Priority | Burst-length");
for(int i=0;i<count;i++)
{
System.out.println(pr.get(i).id+" "+pr.get(i).priority+" "+pr.get(i).burstLength);
}

int max=100;
int ind=0;
int time=0;
while(pr.size()!=0)
{
max=100;
for(int i=0;i<count;i++){
if(pr.get(i).priority<max){
max=pr.get(i).priority;
ind=i;   
}
else if(pr.get(i).priority==max)
{
if(pr.get(i).burstLength<pr.get(ind).burstLength)
{
ind=i;
}

}

}
pr.get(ind).TWT=time-0;
time=time+pr.get(ind).burstLength;
pr1.add(pr.get(ind));
pr.remove(ind);
count--;
}
float awt;
float total=0;
for(int i=0;i<pr1.size();i++)
{
total=total+pr1.get(i).TWT;
}
awt=total/pr1.size();


time=0;
ind=0;
while(pr2.size()!=0)
{
max=100;
for(int i=0;i<pr2.size();i++)
{
if(pr2.get(i).priority<max)
{
max=pr2.get(i).priority;
ind=i;   
}
else if(pr2.get(i).priority==max)
{
if(pr2.get(i).id<pr2.get(ind).id)
{
ind=i;
}

}

}
pr2.get(ind).TWT=time-0;
time=time+pr2.get(ind).burstLength;
pr3.add(pr2.get(ind));
pr2.remove(ind);
}



float awt1;
float total1=0;
for(int i=0;i<pr3.size();i++)
{
total1=total1+pr3.get(i).TWT;
}
awt1=total1/pr3.size();
System.out.println("The avearge waiting time of SJF is "+ awt);
System.out.println("The avearge waiting time of priority scheduling is "+ awt1);
System.out.println("Process ID | Priority | Burst-length | Scheduling algorithm | Total waiting time");
if(awt1>awt)
{

for(int i=0;i<pr1.size();i++)
{
System.out.println(pr1.get(i).id+" "+pr1.get(i).priority+" "+pr1.get(i).burstLength+" "+"SJF"+" "+pr1.get(i).TWT);
}
for(int i=0;i<pr3.size();i++)
{
System.out.println(pr3.get(i).id+" "+pr3.get(i).priority+" "+pr3.get(i).burstLength+" "+"Priority"+" "+pr3.get(i).TWT);
}
}
else
{
for(int i=0;i<pr3.size();i++)
{
System.out.println(pr3.get(i).id+" "+pr3.get(i).priority+" "+pr3.get(i).burstLength+" "+"Priority"+" "+pr3.get(i).TWT);
}

for(int i=0;i<pr1.size();i++)
{
System.out.println(pr1.get(i).id+" "+pr1.get(i).priority+" "+pr1.get(i).burstLength+" "+"SJF"+" "+pr1.get(i).TWT);
}
}

}

}

Proc.java

public class Proc {

int id;

int burstLength;

int priority;

int TWT;

Proc()

{

}

void setId(int Id)

{

id=Id;

}

int getId()

{

return id;

}

void setburstLength(int burstlen)

{

burstLength=burstlen;

}

int getburstLength()

{

return burstLength;

}

void setpriority(int pri)

{

priority=pri;

}

int getpriority()

{

return priority;

}

}

Answer 1

Java code:-

import java.io.*;
class round
{
public static void main(String args[])throws IOException
{
DataInputStream in=new DataInputStream(System.in);
int i,j,k,q,sum=0;
System.out.println(“Enter number of process:”);
int n=Integer.parseInt(in.readLine());
int bt[]=new int[n];
int wt[]=new int[n];
int tat[]=new int[n];
int a[]=new int[n];
System.out.println(“Enter brust Time:”);
for(i=0;i<n;i++)
{
System.out.println(“Enter brust Time for “+(i+1));
bt[i]=Integer.parseInt(in.readLine());
}
System.out.println(“Enter Time quantum:”);
q=Integer.parseInt(in.readLine());
for(i=0;i<n;i++)
a[i]=bt[i];
for(i=0;i<n;i++)
wt[i]=0;
do
{
for(i=0;i<n;i++)
{
if(bt[i]>q)
{
bt[i]-=q;
for(j=0;j<n;j++)
{
if((j!=i)&&(bt[j]!=0))
wt[j]+=q;
}
}
else
{
for(j=0;j<n;j++)
{
if((j!=i)&&(bt[j]!=0))
wt[j]+=bt[i];
}
bt[i]=0;
}
}
sum=0;
for(k=0;k<n;k++)
sum=sum+bt[k];
}
while(sum!=0);
for(i=0;i<n;i++)
tat[i]=wt[i]+a[i];
System.out.println(“process\t\tBT\tWT\tTAT”);
for(i=0;i<n;i++)
{
System.out.println(“process”+(i+1)+”\t”+a[i]+”\t”+wt[i]+”\t”+tat[i]);
}
float avg_wt=0;
float avg_tat=0;
for(j=0;j<n;j++)
{
avg_wt+=wt[j];
}
for(j=0;j<n;j++)
{
avg_tat+=tat[j];
}
System.out.println(“average waiting time “+(avg_wt/n)+”\n Average turn around time”+(avg_tat/n));
}
}
/*Round robin Scheduling algorithm output:

Enter number of process:
4
Enter brust Time:
Enter brust Time for 1
4
Enter brust Time for 2
5
Enter brust Time for 3
6
Enter brust Time for 4
7
Enter Time quantum:
4

process BT WT TAT
process1 4 0 4
process2 5 12 17
process3 6 13 19
process4 7 15 22

average waiting time 10.0
Average turn around time15.5
*/