engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Operating Systems CPU Scheduling Process Scheduling
Consider the following table of arrival time and burst time for three processes P0, Pl 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?
1
5.0 ms
2
4.33 ms
3
6.33 ms
4
7.33 ms