Jobs of length 8, 2 and 4 arrive together. In what order does shortest job first run them?
- Choose the shortest available each time.
- 2, then 4, then 8.
Answer 2, 4, 8
A-level Computer Science revision · Processors, software and development
The OS scheduler decides which process uses the CPU. Round robin gives each process a fixed time slice in turn. First come first served runs in arrival order. Shortest job first runs the shortest job next. Shortest remaining time pre-empts for a job with less time left. Multi-level feedback queues move processes between priority queues.
Watch out First come first served is not pre-emptive: a long job blocks short ones behind it.
Jobs of length 8, 2 and 4 arrive together. In what order does shortest job first run them?
Answer 2, 4, 8
Jobs A (5 ms), B (3 ms) and C (1 ms) arrive together and run first come first served in order A, B, C. When does C finish, in ms?
Which algorithm can cause starvation of long jobs?
Which algorithm gives each process an equal time slice in turn?
A-level Computer Science Pro, OCR H446
£119 once
Price rises to £199 on 1 January. Save £80 by joining before then.
At least 12 months of access
No VAT is charged.