Operating Systems · Previous year questions
CPU Scheduling
27 questions from GATE CS 2011 to 2026, newest first.
Questions
GATE CS 2026 Set 1, Q.64
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, Controllers (C), requires a CPU bur...
CPU Scheduling
GATE CS 2026 Set 2, Q.23
Which one of the following CPU scheduling algorithms cannot be preemptive?
CPU Scheduling
GATE CS 2025 Set 1, Q.38
A computer has two processors, and . Four processes with CPU bursts of 20, 16, 25, and 10 milliseconds, respectively, arrive at the same time and...
CPU Scheduling
GATE CS 2025 Set 2, Q.26
Processes arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively. Sh...
CPU Scheduling
GATE CS 2024 Set 1, Q.25
Which of the following process state transitions is/are NOT possible?
Processes, Threads and System Calls · CPU Scheduling
GATE CS 2024 Set 2, Q.25
Consider a process P running on a CPU. Which one or more of the following events will always trigger a context switch by the OS that results in process P moving to a non-running...
Processes, Threads and System Calls · CPU Scheduling
GATE CS 2024 Set 2, Q.37
Consider a single processor system with four processes A, B, C, and D, represented as given below, where for each process the first value is its arrival time, and the second val...
CPU Scheduling
GATE CS 2023, Q.27
Which one or more of the following CPU scheduling algorithms can potentially cause starvation?
CPU Scheduling
GATE CS 2022, Q.42
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 order P, Q, R, S, all at time...
CPU Scheduling
GATE CS 2021 Set 1, Q.35 (CS Q.25)
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 achievabl...
CPU Scheduling
GATE CS 2021 Set 2, Q.24 (CS Q.14)
Which of the following statement(s) is/are correct in the context of CPU scheduling?
CPU Scheduling
GATE CS 2020, Q.22 (CS Q.12)
Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running process can move to ready state. II. A ready process can...
CPU Scheduling · Processes, Threads and System Calls
GATE CS 2020, Q.60 (CS Q.50)
Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume...
CPU Scheduling
GATE CS 2019, Q.51 (CS Q.41)
Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below: | Process | Arrival time | CPU burst...
CPU Scheduling
GATE CS 2017 Set 1, Q.24 (CS Q.24)
Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below: Process Arrival time Burst time P1 0 7 P2 3...
CPU Scheduling
GATE CS 2017 Set 2, Q.51 (CS Q.51)
Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes...
CPU Scheduling
GATE CS 2016 Set 1, Q.30 (CS Q.20)
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 following process scheduling al...
CPU Scheduling
GATE CS 2016 Set 2, Q.57 (CS Q.47)
Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-tim...
CPU Scheduling
GATE CS 2015 Set 1, Q.56 (CS Q.46)
Consider a uniprocessor system executing three tasks , and , each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically a...
CPU Scheduling
GATE CS 2015 Set 3, Q.11 (CS Q.1)
The maximum number of processes that can be in Ready state for a computer system with CPUs is
Processes, Threads and System Calls · CPU Scheduling
GATE CS 2015 Set 3, Q.44 (CS Q.34)
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time? Process Arrival Time Processing Time A 0...
CPU Scheduling
GATE CS 2014 Set 1, Q.42 (CS Q.32)
Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds. Process Name Arrival Time Execution Time A 0 6 B 3 2...
CPU Scheduling
GATE CS 2014 Set 2, Q.42 (CS Q.32)
Three processes A, B and C each execute a loop of 100 iterations. In each iteration of the loop, a process performs a single computation that requires CPU milliseconds and...
CPU Scheduling
GATE CS 2014 Set 3, Q.42 (CS Q.32)
An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival t...
CPU Scheduling
GATE CS 2013, Q.10 (CS Q.10)
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates...
CPU Scheduling
GATE CS 2012, Q.31 (CS Q.31)
Consider the 3 processes, , and shown in the table. | Process | Arrival time | Time Units Required | | :--- | :--- | :--- | | | 0 | 5 | | | 1 | 7 |...
CPU Scheduling
GATE CS 2011, Q.16 (CS Q.16)
A thread is usually defined as a "light weight process" because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this,...
CPU Scheduling