Let’s change the assumptions and now assume that the jobs arrive at different times as follows:
Process | Burst | Priority | Arrival Time |
---|---|---|---|
P1 | 8 | 4 | 0 |
P2 | 6 | 1 | 2 |
P3 | 1 | 2 | 2 |
P4 | 9 | 2 | 1 |
P5 | 3 | 3 | 3 |
Calculate the turnaround and wait times for the following algorithms:
- First Come First Serve
- Non-Preemptive Priority Scheduling
- Preemptive Priority Scheduling
- Round Robin (assume a quantum of 1ms)
JUST TAP ON THE ATTACHMENT BUTTON FOR ANSWER:
Support Us By Voting Up Answers!