Operating Systems · CPU and I/O Scheduling
Official IIT answer key · IIT Bombay · Audited Aug 2026
GATE CSE 2021 Set 1 Q25 · NAT · 1 mark
Key concept
No account needed
Sit 5 related CPU and I/O SchedulingPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
CPU and I/O scheduling in GATE CS is predominantly an algorithmic and numerical topic focusing on precise Gantt chart simulation, turnaround/waiting time computation, and comparative metric evaluation. While Preemptive Shortest Remaining Time First (SRTF) and Round Robin (RR) form the core of numerical problems, questions also assess real-time scheduling (Rate Monotonic), multi-processor scheduling, disk I/O head movement algorithms (SCAN, SSTF, C-LOOK), and theoretical properties like starvation and preemption hardware requirements.
Full CPU and I/O Scheduling guide →Three processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is … milliseconds.
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
