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 (round to nearest integer) is _________ milliseconds.
GATE CS 2021 (Forenoon) — Question 35
Operating Systems (OS)CPU and I/O SchedulingNAT1 markMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on CPU and I/O Scheduling
- GATE CS 2026 (Forenoon) · Q64Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second typ…
- GATE CS 2026 (Afternoon) · Q23Which one of the following CPU scheduling algorithms cannot be preemptive?
- GATE CS 2025 (Forenoon) · Q29Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into I/O queue whenever an I/O relat…
- GATE CS 2025 (Forenoon) · Q38A computer has two processors, M 1 and M 2 . Four processes P 1, P 2, P 3, P 4 with CPU bursts of 20, 16, 25, and 10 milliseconds, respecti…
- GATE CS 2025 (Afternoon) · Q26Processes 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,…
- GATE CS 2024 (Afternoon) · Q37Consider a single processor system with four processes A, B, C, and D, represented as given below, where for each process the first value i…

