Question: Process Arrival time Burst Time Priority P0 0 ms 9 ms 1 P1 1 ms 4 ms 3 P2 2 ms 9 ms 2 Given
| Process | Arrival time | Burst Time | Priority |
| P0 | 0 ms | 9 ms | 1 |
| P1 | 1 ms | 4 ms | 3 |
| P2 | 2 ms | 9 ms | 2 |
Given the previous table, which scheduling algorithm satisfies the requirement of minimum waiting time?
| a. | FCFS | |
| b. | SJF | |
| c. | Priority scheduling |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
