Consider the following table of arrival time and burst time for three processes P0, Pl and P2. Process Arrival time Burst Time P0 0 ms 9 ms P1 1 ms 4 ms P2 2 ms 9 ms The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?

GATE Computer Science (CS) 2011 Solved Paper

Question : 45 of 65

Marks: +1, -0

Consider the following table of arrival time and burst time for three processes P0, Pl and P2.

Process	Arrival time	Burst Time
P0	0 ms	9 ms
P1	1 ms	4 ms
P2	2 ms	9 ms

The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?

5.0 ms
4.33 ms
6.33 ms
7.33 ms

Validate

Go to Question:

Prev Question

Next Question