Consider the following CPU processes with arrival times (in milliseconds) and…
PYQ GATE 2017
Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below:
Process | Arrival Time | Burst Time |
P1 | 0 | 7 |
P2 | 3 | 3 |
P3 | 5 | 5 |
P4 | 6 | 2 |
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.
Attempted by 292 students.
Sign up free to check your answer
Sign up freeLoading lesson…

