The GATE Grind

GATE 2021 CS – Question 35

Operating System · CPU and I/O Scheduling · 1 mark · Numerical answer

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.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: 12

Explanation

SJF order 10, 16, 20 gives waiting times 0, 10, 26. Average = 36/3 = 12 ms.