Consider the following table of arrival time and burst time for three…
PYQ GATE 2011
Consider the following table of arrival time and burst time for three processes P0,P1 and P2.
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
- C.
6.33 ms
- D.
7.33 ms
Attempted by 663 students.
Sign up free to check your answer
Sign up freeLoading lesson…

