Gate CS-2011 Question Paper With Solutions

Q. 35 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.33ms

(C) 6.33ms

(D) 7.33ms

Answer: (A)

Explanation:

Gate CS-2011 Question Paper With Solutions

Learn More:   Gate CS-2010 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here