Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

19
M: +1.00/-0.00

Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below:

If the pre-emptive shortest remaining time first scheduling algorithm is used to schedule the processes, then the average waiting time across all processes is _______ milliseconds.

[GATE CS 2017 Set 1]
A