Operating Systems · CPU and I/O Scheduling

Official IIT answer key · IISc Bangalore · Audited Aug 2026

GATE CSE 2016 Set 2 Q47 · NAT · 2 marks

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. The average turn around time of these processes is ________ milliseconds.

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 · IISc Bangalore · Audited Aug 2026

Take topic test

GATE CSE 2016 Set 2 Q47 · NAT · 2 marks

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. The average turn around time of these processes is ________ milliseconds.

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.

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. The average turn around time of these processes is ________ milliseconds.

Step-by-step verified solution

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

More from GATE CSE 2016 Set 2

More on CPU and I/O Scheduling

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. The average turn around time of these processes is ________ milliseconds.

Step-by-step verified solution

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

More from GATE CSE 2016 Set 2

More on CPU and I/O Scheduling

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. The average turn around time of these processes is ________ milliseconds.

Step-by-step verified solution

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

More from GATE CSE 2016 Set 2

More on CPU and I/O Scheduling

Share this solution

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. The average turn around time of these processes is ________ milliseconds.

Step-by-step verified solution

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

More from GATE CSE 2016 Set 2

More on CPU and I/O Scheduling

Share this solution