Assume that you have the following processes all arriving at time 0:
| Process | Burst | Priority |
|---|---|---|
| P1 | 8 | 4 |
| P2 | 6 | 1 |
| P3 | 1 | 2 |
| P4 | 9 | 2 |
| P5 | 3 | 3 |
For each of the following CPU scheduling algorithms, determine the turnaround and wait times for each process as well as the average wait and turnaround times.
- First Come First Serve
- Shortest Job First
- Non-Preemptive Priority Scheduling
- Round Robin (assume a quantum of 1ms)
Which of the four algorithms has the shortest wait time? Which has the fastest average turnaround time?
You can get your answer by just tapping on the attachment button:
Support Us By Voting Up Answers!