Scheduling: FCFS, SJF, SRTF
Scheduling criteria and when the scheduler runs; preemptive versus non-preemptive policies and the dispatcher; completion, turnaround, waiting and response time with their conditions; FCFS, SJF and SRTF timelines and averages on one worked example with a Gantt chart; idle gaps and utilisation; when SJF and SRTF are optimal; predicting the next burst by exponential averaging; and the solved GATE CS 2024 Set 2 Q.37 and 2025 Set 2 Q.26. Every timeline and average was produced by a scheduling simulator.
