Operating Systems · CPU and I/O Scheduling

Official IIT answer key · IIT Kharagpur · Audited Aug 2026

GATE CSE 2014 Set 3 Q32 · NAT · 2 marks

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds): The average waiting time (in milliseconds) of the processes is ________.

Numerical answer

Enter a value to check

Key concept

CPU and I/O Scheduling

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests CPU and I/O Scheduling

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 →

More on CPU and I/O Scheduling

All 25 questions on CPU and I/O Scheduling →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Operating Systems · CPU and I/O Scheduling

Official IIT answer key · IIT Kharagpur · Audited Aug 2026

Take topic test

GATE CSE 2014 Set 3 Q32 · NAT · 2 marks

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds): The average waiting time (in milliseconds) of the processes is ________.

Numerical answer

Enter a value to check

Key concept

CPU and I/O Scheduling

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests CPU and I/O Scheduling

Full CPU and I/O Scheduling guide →

More on CPU and I/O Scheduling

All 25 questions on CPU and I/O Scheduling →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds): The average waiting time (in milliseconds) of the processes is ________.

Step-by-step verified solution

Check you can still solve CPU and I/O Scheduling under a clock

More from GATE CSE 2014 Set 3

More on CPU and I/O Scheduling

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds): The average waiting time (in milliseconds) of the processes is ________.

Step-by-step verified solution

Check you can still solve CPU and I/O Scheduling under a clock

More from GATE CSE 2014 Set 3

More on CPU and I/O Scheduling

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds): The average waiting time (in milliseconds) of the processes is ________.

Step-by-step verified solution

Check you can still solve CPU and I/O Scheduling under a clock

More from GATE CSE 2014 Set 3

More on CPU and I/O Scheduling

Share this solution

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds): The average waiting time (in milliseconds) of the processes is ________.

Step-by-step verified solution

Check you can still solve CPU and I/O Scheduling under a clock

More from GATE CSE 2014 Set 3

More on CPU and I/O Scheduling

Share this solution