Consider the following table of arrival time and burst time for three processes P0, P1, P2.
Consider the following table of arrival time and burst time for three processes P0, P1, P2.
P0: Arrival time 0 s, Burst time 9 s
P1: Arrival time 1 s, Burst time 4 s
P2: Arrival time 2 s, Burst time 9 s
The preemptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of process. The average waiting time for the three process is ________.
Show answerHide answer
Correct answer: (D) 5 seconds