Operating Systems · CPU and I/O Scheduling
Official IIT answer key · IIT Guwahati · Audited Aug 2026
GATE CSE 2025 Set 2 Q26 · MCQ · 1 mark
Processes P1, P2, P3, P4 arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively. Shortest Remaining Time First (SRTF) algorithm is used as the CPU scheduling policy. Ignore context switching times.
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 →Processes P1, P2, P3, P4 arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively. Shortest Remaining Time First (SRTF) algorithm is used as the CPU scheduling policy. Ignore context switching times. Which ONE of the following correctly gives the average turnaround time of the four processes in 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.
