The GATE Grind

GATE Operating System: CPU and I/O Scheduling – Previous Year Questions

29 GATE previous year questions on CPU and I/O Scheduling (Operating System, Computer Science) with answers and explanations, from every paper.

29 questions worth 47 marks in all (11 1-mark, 18 2-mark). Asked between 2007 and 2026, so you can see how the topic has been tested over time.

  1. GATE 2007 CS Q16 (1 mark, Multiple choice) – Match CPU scheduling algorithms P. Gang; Q. Rate monotonic; R. Fair share, with applications1. Guaranteed scheduling;2. Real-time scheduling;3. Thread…
  2. GATE 2007 CS Q55 (2 marks, Multiple choice) – Under shortest-remaining-time-first scheduling, what is total waiting time of P2? Process Execution time Arrival time --- --- --- P1 20 0 P2 25 15 P3…
  3. GATE 2009 CS Q32 (2 marks, Multiple choice) – The diagram shows process states in a uniprocessor system. Assume there are always ready processes. Which statements are TRUE? I. A process making…
  4. GATE 2021 CS (CS2) Q24 (1 mark, Multiple select) – Which statements about CPU scheduling are correct?
  5. GATE 2015 CS (CS3) Q57 (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?
  6. GATE 2010 CS Q35 (1 mark, Multiple choice) – Which are true? I: Shortest remaining time first may cause starvation. II: Preemptive scheduling may cause starvation. III: Round robin is better than…
  7. GATE 2011 CS Q45 (2 marks, Multiple choice) – Processes P₀,P₁,P₂ have arrivals 0,1,2 ms and bursts 9,4,9 ms respectively. Use preemptive shortest-job-first, scheduling only at…
  8. GATE 2013 CS Q20 (1 mark, Multiple choice) – Priorities are proportional to process waiting times and start at zero. Every T time units the scheduler reevaluates priorities and selects the next…
  9. GATE 2012 CS Q41 (2 marks, Multiple choice) – Processes P₁,P₂,P₃ have (arrival,CPU time) (0,5),(1,7),(3,4). Find completion orders for FCFS and round robin with quantum two.
  10. GATE 2017 CS (CS2) Q61 (2 marks, Numerical answer) – Processes P₁,…,P₅ have (arrival ms, CPU burst ms, priority): (0,11,2),(5,28,0),(12,2,3),(2,10,1),(9,16,4). Priority 0 is highest; none has I/O. Find…
  11. GATE 2016 CS (CS2) Q57 (2 marks, Numerical answer) – Preemptive shortest-remaining-time-first schedules P₁:(arrival 0, burst 10), P₂:(3,6), P₃:(7,1), P₄:(8,3), all in ms. Find mean turnaround time.
  12. GATE 2014 CS (CS3) Q42 (2 marks, Numerical answer) – A preemptive OS uses shortest remaining time first. Process (arrival time, CPU burst), in ms: P1(0,12), P2(2,4), P3(3,6), P4(8,5). Find average…
  13. GATE 2014 CS (CS2) Q42 (2 marks, Numerical answer) – Processes A,B,C each run 100 iterations, each consisting of t c CPU time followed by t io I/O time. They have separate I/O devices; OS overhead is…
  14. GATE 2014 CS (CS1) Q42 (2 marks, Numerical answer) – Single-CPU processes A,B,C,D,E have (arrival,execution) times in ms: A(0,6), B(3,2), C(5,4), D(7,6), E(10,3). Find average turnaround time under…
  15. GATE 2017 CS (CS1) Q34 (1 mark, Numerical answer) – Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below: Process Arrival…
  16. GATE 2016 CS (CS1) Q30 (1 mark, Multiple choice) – Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the…
  17. GATE 2015 CS (CS1) Q52 (2 marks, Numerical answer) – Consider a uniprocessor system executing three tasks T 1, T 2 and T 3, each of which is composed of an infinite sequence of jobs (or instances) which…
  18. GATE 2018 CS Q63 (2 marks, Numerical answer) – Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders (numbered as 0, 1, ..., 199), and 256 sectors per track (numbered…
  19. GATE 2019 CS Q51 (2 marks, Numerical answer) – Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below: Process P1…
  20. GATE 2026 CS (CS2) Q23 (1 mark, Multiple choice) – Which one of the following CPU scheduling algorithms cannot be preemptive?
  21. GATE 2026 CS (CS1) Q64 (2 marks, Numerical answer) – Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type,…
  22. GATE 2025 CS (CS2) Q26 (1 mark, Multiple choice) – Processes 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, and 9…
  23. GATE 2025 CS (CS1) Q29 (1 mark, Numerical answer) – Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into I/O queue whenever an I/O related…
  24. GATE 2025 CS (CS1) Q38 (2 marks, Multiple choice) – A 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, respectively, arrive…
  25. GATE 2024 CS (CS2) Q37 (2 marks, Multiple choice) – Consider a single processor system with four processes A, B, C, and D, where for each process the first value is its arrival time, and the second…
  26. GATE 2023 CS Q27 (1 mark, Multiple select) – Which one or more of the following CPU scheduling algorithms can potentially cause starvation?
  27. GATE 2022 CS Q42 (2 marks, Multiple choice) – Consider four processes P, Q, R, and S scheduled on a CPU as per round robin algorithm with a time quantum of 4 units. The processes arrive in the…
  28. GATE 2021 CS (CS1) Q35 (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…
  29. GATE 2020 CS Q60 (2 marks, Numerical answer) – Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round…