Home › Previous year questions › GATE 2015 CS (CS3) › Question 57GATE 2015 CS (CS3) – Question 57 Operating System · CPU and I/O Scheduling · 2 marks · Multiple choice
Processes have (arrival,processing) times A=(0,3), B=(1,6), C=(4,4), D=(6,2). Which policy gives the lowest average turnaround time?
FCFS Nonpreemptive shortest job first Shortest remaining time Round robin, quantum 2 Practise this question in The GATE Grind →
Show answer and explanation Correct answer: (C) Shortest remaining time
Explanation SRT executes A from zero to three, B from three to four, then C from four to eight, D from eight to ten, and B from ten to fifteen; the equal remaining-time tie at six does not change the average. Turnarounds are 3,14,4,4, averaging 6.25. Nonpreemptive SJF/FCFS delay short arriving jobs. Thus C minimizes average turnaround here.
More CPU and I/O Scheduling questions GATE 2021 CS (CS2) Q24 – Which statements about CPU scheduling are correct? GATE 2026 CS (CS1) Q64 – Consider a CPU that has to execute two types of processes. The first type, Actuators (A),… GATE 2026 CS (CS2) Q23 – Which one of the following CPU scheduling algorithms cannot be preemptive? GATE 2025 CS (CS1) Q29 – Suppose in a multiprogramming environment, the following C program segment is executed. A… GATE 2025 CS (CS1) Q38 – A computer has two processors, M 1 and M 2. Four processes P 1, P 2, P 3, P 4 with CPU… GATE 2025 CS (CS2) Q26 – Processes P1, P2, P3, P4 arrive in that order at times 0, 1, 2, and 8 milliseconds… All CPU and I/O Scheduling questions →