GATE | GATE CS 2011 | Question 65
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?
(A) 5.0 ms
(B) 4.33 ms
Explanation: See Question 4 of https://www.geeksforgeeks.org/operating-systems-set-6/
Watch GeeksforGeeks Video Explanation :
My Personal Notes arrow_drop_up
Please Login to comment...