Activity 1
Match each algorithm to its description and whether it is pre-emptive or not.
Operating Systems • Scheduling
Scheduling Interactive
Explore first come first served, shortest job first, round robin, shortest remaining time, and multi-level feedback queues. Then compare how the algorithms affect waiting time for three example processes.
Activity 2
Use the same example as the spreadsheet answer: processes A=20, B=10, C=5, with a time slice of 5 cycles.
FCFS
16.67
Average wait time
SJF
6.67
Average wait time
RR
13.33
Average wait time
SRT
6.7
Average wait time
| Algorithm | Your choice: best average wait time? | Your choice: pre-emptive? | Execution order used on the page | Wait times |
|---|