Which scheduling algorithm will be more appropriate between ‘shortest job first’ and ‘first come first serve’ for given set of processes in terms of…
bitm Operating System · 2019 · Solved Question with Answer
Which scheduling algorithm will be more appropriate between ‘shortest job first’ and ‘first come first serve’ for given set of processes in terms of average waiting time?
| Process | Arrival time | Burst time |
|---|---|---|
| P1 | 0 | 8 |
| P2 | 1 | 6 |
| P3 | 3 | 5 |
| P4 | 7 | 7 |