Crack
GATE
C
G
Topic
CPU and I/O Scheduling
Operating System
0
/ 16 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2
3
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
1
0.3
0
0.7
2018
0
0
0
0
2019
1
0
0
1
2020
3
2
0
1
2021
1
0
0.5
0.5
2022
1
1
0
0
2023
1
0
1
0
2024
0.5
0.5
0
0
2025
1
1
0
0
2026
1
0.5
0
0.5
1
CS 2026 Set 1 · 2 marks · NAT · Moderate
Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of
6
6
6
seconds. The second type, Controllers (C), requires a CPU burst of
8
8
8
seconds. A new process of type A arrives at time
t
=
10
,
20
,
30
,
40
,
t = 10, 20, 30, 40,
t
=
10
,
20
,
30
,
40
,
and
50
50
50
(in seconds). Similarly, a new process of type C arrives at time
t
=
11
,
22
,
33
,
44
,
t = 11, 22, 33, 44,
t
=
11
,
22
,
33
,
44
,
and
55
55
55
(in seconds). The CPU scheduling policy is First Come First Serve (FCFS). The first process of type A starts running at
t
=
10
t = 10
t
=
10
seconds. The average waiting time (in seconds) for the 10 processes is ____. (rounded off to one decimal place)
2
CS 2026 Set 2 · 1 mark · MCQ · Easy
Which one of the following CPU scheduling algorithms
cannot
be preemptive?
3
CS 2025 Set 1 · 2 marks · MCQ · Moderate
A computer has two processors,
M
1
M_1
M
1
and
M
2
M_2
M
2
. Four processes
P
1
P_1
P
1
,
P
2
P_2
P
2
,
P
3
P_3
P
3
,
P
4
P_4
P
4
with CPU bursts of
20
20
20
,
16
16
16
,
25
25
25
, and
10
10
10
milliseconds, respectively, arrive at the same time and these are the only processes in the system. The scheduler uses non-preemptive priority scheduling, with priorities decided as follows:
4
CS 2025 Set 2 · 1 mark · MCQ · Moderate
Processes
P
1
P_1
P
1
,
P
2
P_2
P
2
,
P
3
P_3
P
3
,
P
4
P_4
P
4
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. Shortest Remaining Time First (SRTF) algorithm is used as the CPU scheduling policy. Ignore context switching times.
5
CS 2024 Set 2 · 2 marks · MCQ · Moderate
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 value is its CPU burst time.
6
CS 2023 · 1 mark · MSQ · Easy
Which one or more of the following CPU scheduling algorithms can potentially cause starvation?
7
CS 2022 · 2 marks · MCQ · Hard
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
t
=
0
t=0
t
=
0
. There is exactly one context switch from S to Q, exactly one context switch from R to Q, and exactly two context switches from Q to R. There is no context switch from S to P. Switching to a ready process after the termination of another process is also considered a context switch. Which one of the following is NOT possible as CPU burst time (in time units) of these processes?
8
CS 2021 Set 1 · 1 mark · NAT · Easy
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 (rounded to nearest integer) is ____ milliseconds.
9
CS 2021 Set 2 · 1 mark · MSQ · Moderate
Which of the following statement(s) is/are correct in the context of CPU scheduling?
10
CS 2020 · 1 mark · MCQ · Easy
Consider the following statements about process state transitions for a system using preemptive scheduling.
11
CS 2020 · 2 marks · MCQ · Moderate
Consider the following five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time.
12
CS 2020 · 2 marks · NAT · Moderate
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 that the processes are scheduled in the order
P
1
,
P
2
,
P
3
,
P
4
P_1, P_2, P_3, P_4
P
1
,
P
2
,
P
3
,
P
4
.
13
CS 2019 · 2 marks · NAT · Moderate
Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:
14
CS 2015 Set 1 · 2 marks · NAT · Hard
Consider a uniprocessor system executing three tasks
T
1
T_1
T
1
,
T
2
T_2
T
2
and
T
3
T_3
T
3
, each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of
3
3
3
,
7
7
7
and
20
20
20
milliseconds, respectively. The priority of each task is the inverse of its period, and the available tasks are scheduled in order of priority, with the highest priority task scheduled first. Each instance of
T
1
T_1
T
1
,
T
2
T_2
T
2
and
T
3
T_3
T
3
requires an execution time of
1
1
1
,
2
2
2
and
4
4
4
milliseconds, respectively. Given that all tasks initially arrive at the beginning of the
1
s
t
1^{\mathrm{st}}
1
st
millisecond and task preemptions are allowed, the first instance of
T
3
T_3
T
3
completes its execution at the end of ____________ milliseconds.
15
CS 2015 Set 1 · 2 marks · NAT · Moderate
Suppose the following disk request sequence (track numbers) for a disk with
100
100
100
tracks is given:
45
,
20
,
90
,
10
,
50
,
60
,
80
,
25
,
70
45, 20, 90, 10, 50, 60, 80, 25, 70
45
,
20
,
90
,
10
,
50
,
60
,
80
,
25
,
70
. Assume that the initial position of the R/W head is on track
50
50
50
. The additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards
100
100
100
when it starts execution) is ____ tracks.
16
CS 2015 Set 3 · 2 marks · MCQ · Moderate
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?