From 36ea510180f13f07118aecaaa94b6f9e774a8608 Mon Sep 17 00:00:00 2001 From: deshna-jain <36550030+deshna-jain@users.noreply.github.com> Date: Wed, 9 Oct 2019 14:48:12 +0530 Subject: [PATCH] RoundRobin scheduling for different arrival times --- disk_sch_java/src/Round.java | 77 ++++++++++++++++++++++++++++++++++++ 1 file changed, 77 insertions(+) create mode 100644 disk_sch_java/src/Round.java diff --git a/disk_sch_java/src/Round.java b/disk_sch_java/src/Round.java new file mode 100644 index 0000000..963973c --- /dev/null +++ b/disk_sch_java/src/Round.java @@ -0,0 +1,77 @@ +import java.util.*; +import java.lang.*; +public class Round{ +public static void main(String[] args){ +Scanner in = new Scanner(System.in); +System.out.println("Enter the no. of processes"); +int n = in.nextInt(); +int[] at = new int[n]; +int[] bt=new int[n]; +int[] bts=new int[n]; +int[] ct=new int[n]; +int[] st=new int[n]; +Queue rq = new LinkedList<>(); +int[] wt=new int[n]; +int[] tat=new int[n]; +System.out.println("Enter the arrival time "); +int sum=0; +for(int i=0;itq){ +bt[k]=bt[k]-tq; +t=t+tq; +if(count0) +rq.add(k); +}else{ +if(bt[k]!=0){ + t=t+bt[k]; + ct[k]=t; +bt[k]=0; +} +} +System.out.println(rq+" "+t); +} +int sum1=0; +int sum2=0; +for(int l=0;l