GATE Operating System: CPU and I/O Scheduling – Previous Year Questions
15 GATE previous year questions on CPU and I/O Scheduling (Operating System, Computer Science) with answers and explanations, from every paper.
- GATE 2017 CS Q34 – Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below: Process Arrival…
- GATE 2016 CS Q30 – 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…
- GATE 2015 CS Q52 – 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…
- GATE 2018 CS Q63 – 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…
- GATE 2019 CS Q51 – Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below: Process P1…
- GATE 2026 CS (CS2) Q23 – Which one of the following CPU scheduling algorithms cannot be preemptive?
- GATE 2026 CS (CS1) Q64 – 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,…
- GATE 2025 CS (CS2) Q26 – 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…
- GATE 2025 CS (CS1) Q29 – Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into I/O queue whenever an I/O related…
- 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 bursts of 20, 16, 25, and 10 milliseconds, respectively, arrive…
- GATE 2024 CS (CS2) Q37 – 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…
- GATE 2023 CS Q27 – Which one or more of the following CPU scheduling algorithms can potentially cause starvation?
- GATE 2022 CS Q42 – 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…
- GATE 2021 CS Q35 – 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…
- GATE 2020 CS Q60 – Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round…