Crack
GATE
C
G
Topic
Deadlock
Operating System
0
/ 8 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
0.7
0.7
0
0
2018
0
0
0
0
2019
1
1
0
0
2020
0
0
0
0
2021
0.5
0
0.5
0
2022
1
0
1
0
2023
0
0
0
0
2024
0
0
0
0
2025
0.5
0
0.5
0
2026
1
0
0.5
0.5
1
CS 2026 Set 1 · 1 mark · MSQ · Moderate
With respect to deadlocks in an operating system, which of the following statements is/are FALSE?
2
CS 2026 Set 1 · 1 mark · NAT · Moderate
Consider a system consisting of
k
k
k
instances of a resource
R
R
R
, being shared by
5
5
5
processes. Assume that each process requires a maximum of two instances of resource
R
R
R
and a process can request or release only one instance at a time. Further, a process can request the second instance of the resource only after acquiring the first instance.
3
CS 2025 Set 2 · 2 marks · MSQ · Moderate
P
=
{
P
1
,
P
2
,
P
3
,
P
4
}
P = \{P_1, P_2, P_3, P_4\}
P
=
{
P
1
,
P
2
,
P
3
,
P
4
}
consists of all active processes in an operating system.
R
=
{
R
1
,
R
2
,
R
3
,
R
4
}
R = \{R_1, R_2, R_3, R_4\}
R
=
{
R
1
,
R
2
,
R
3
,
R
4
}
consists of single instances of distinct types of resources in the system.
4
CS 2022 · 1 mark · MSQ · Moderate
Which of the following statements is/are TRUE with respect to deadlocks?
5
CS 2021 Set 2 · 2 marks · MSQ · Hard
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock (
L
L
L
). The following scheme is used to own a resource instance :
6
CS 2019 · 2 marks · MCQ · Moderate
Consider the following snapshot of a system running
n
n
n
concurrent processes. Process
i
i
i
is holding
X
i
X_i
X
i
instances of a resource
R
\mathrm{R}
R
,
1
≤
i
≤
n
1 \le i \le n
1
≤
i
≤
n
. Assume that all instances of
R
\mathrm{R}
R
are currently in use. Further, for all
i
i
i
, process
i
i
i
can place a request for at most
Y
i
Y_i
Y
i
additional instances of
R
\mathrm{R}
R
while holding the
X
i
X_i
X
i
instances it already has. Of the
n
n
n
processes, there are exactly two processes
p
p
p
and
q
q
q
such that
Y
p
=
Y
q
=
0
Y_p = Y_q = 0
Y
p
=
Y
q
=
0
. Which one of the following conditions guarantees that no other process apart from
p
p
p
and
q
q
q
can complete execution?
7
CS 2015 Set 2 · 1 mark · MCQ · Moderate
A system has 6 identical resources and
N
N
N
processes competing for them. Each process can request atmost 2 resources. Which one of the following values of
N
N
N
could lead to a deadlock?
8
CS 2015 Set 3 · 2 marks · MCQ · Moderate
Consider the following policies for preventing deadlock in a system with mutually exclusive resources.