GATE CSE 2021 Set 1 Q35: Minimum average waiting time for bursts of 16, 20 and 10 ms
- Operating System
- 1 mark
- NAT
- No negative marking
Question
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.
Try it: numerical answer: type the value
Show answer and explanation
Answer: 12 (official GATE 2021 final answer key)
Concept used: Shortest Job First minimises the average waiting time when all jobs arrive together.
First step: Run the bursts in the order 10, 16, 20 and average their start times.
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2021 Set 1 CS question paper and final answer key, organised by IIT Bombay. Question paper · Answer key
More Operating System PYQs
- 2026 Session 1 · Q29False statements about deadlocks
- 2026 Session 1 · Q35Minimum resource instances for deadlock freedom (5 processes, max 2)
- 2026 Session 1 · Q59Disk transfer time for random sectors on tracks 5, 12, 7
- 2026 Session 1 · Q63Number of printf calls with fork, continue and break
- 2026 Session 1 · Q64Average FCFS waiting time for alternating A and C processes
- 2026 Session 2 · Q23CPU scheduling algorithm that cannot be preemptive