1
GATE CSE 2020
Numerical
+2
-0.67
Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order P1, P2, P3, P4.
If the time quantum for RR is 4 ms, then the absolute value of the difference between the average turnaround times (in ms) of SJF and RR (round off to 2 decimal places) is _____.
2
GATE CSE 2019
Numerical
+2
-0.67
Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below :

These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is _____.
3
GATE CSE 2016 Set 2
Numerical
+2
-0
Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first.

Process Arrival Time Burst Time
P1
P2
P3
P4
0
3
7
8
10
6
1
3

The average turn around time of these processes is milliseconds.

4
GATE CSE 2015 Set 3
+2
-0.6
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?

Process Arrival Time Processing Time
A 0 3
B 1 6
D 4 4
E 6 2

A
First Come First Serve
B
Non-preemptive Shortest Job First
C
Shortest Remaining Time
D
Round Robin with Quantum value two
GATE CSE Subjects
EXAM MAP
Medical
NEET