GATE | CS | 2011 | Operating System | CPU Scheduling | Question 35

Last Updated :
Discuss
Comments

Consider the following table of arrival time and burst time for three processes P0, P1 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

7.33

This question is part of this quiz :

GATE CS 2011,OS CPU Scheduling
Tags:
GATE
Operating Systems
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy