GATE Papers >> CSE >> 2011 >> Question No 35

Question No. 35 CSE | GATE 2011

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?

Answer : (A) 5.0 ms

stxnDT levitra nizagara

Posted on  18/10/2020 17:44:11  by  dobsonz
Leave a comment