Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Operating Systems CPU Scheduling Process Scheduling
Consider the following table of arrival time and burst time for three processes P0, P1, P2:
| Process | arrival time | Burst time |
| P0 | 0 ms | 7 |
| P1 | 1 ms | 3 |
| P2 | 2 ms | 7 |
The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of a process. What is the average waiting time for the three processes?
1
3 ms
2
3.67 ms
3
4.47 ms
4
4 ms