Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below: Process P1 P2 P3 P4 Arrival time 0 1 3 4 CPU burst time 3 1 3 Z 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 _________ .

GATE Computer Science (CS) 2019 Solved Papers

Question : 51 of 65

Marks: +1, -0

Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:

Process	P1	P2	P3	P4
Arrival time	0	1	3	4
CPU burst time	3	1	3	Z

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 _________ .

Your Answer:

Validate

Solution:

Let’s assume , Z = 2

	Arrival time	CPU time	Completion time	Waiting time
P1	0	3	4	1
P2	1	1	2	0
P3	3	3	9	3
P4	4	Z=2	6	0

Average waiting time (WT)

=\;{1+0+3+0}/{4}=1 {ms}

Hence, Z = 2

Go to Question:

Prev Question

Next Question