Deadlock Prevention, Avoidance and Detection: GATE CS previous year questions (Operating Systems)

GATE CS 2026 Set 1MSQ1 markEasy (estimate)
GATE CS 2026 Set 1, Q.29
With respect to deadlocks in an operating system, which of the following statements is/are FALSE?
Deadlock Prevention, Avoidance and Detection
GATE CS 2026 Set 1NAT1 markEasy (estimate)
GATE CS 2026 Set 1, Q.35
Consider a system consisting of $k$ instances of a resource $R$ , being shared by 5 processes. Assume that each process requires a maximum of two instances of resource $R$ and a...
Deadlock Prevention, Avoidance and Detection
GATE CS 2025 Set 2MSQ2 marksMedium (estimate)
GATE CS 2025 Set 2, Q.48
$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}}$ consists of single instances of distinct types of resources in...
Deadlock Prevention, Avoidance and Detection
GATE CS 2024 Set 2MSQ2 marksMedium (estimate)
GATE CS 2024 Set 2, Q.46
Consider a multi-threaded program with two threads T1 and T2. The threads share two semaphores: s1 (initialized to 1) and s2 (initialized to 0). The threads also share a glo...
Process Synchronization and Concurrency · Deadlock Prevention, Avoidance and Detection
GATE CS 2022MSQ1 markMedium (estimate)
GATE CS 2022, Q.26
Which of the following statements is/are TRUE with respect to deadlocks?
Deadlock Prevention, Avoidance and Detection
GATE CS 2021 Set 2MSQ2 marksMedium (estimate)
GATE CS 2021 Set 2, Q.53 (CS Q.43)
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...
Deadlock Prevention, Avoidance and Detection
GATE CS 2018NAT1 markEasy (estimate)
GATE CS 2018, Q.34 (CS Q.24)
Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of $K$ instances. Resource instances can be requested and...
Deadlock Prevention, Avoidance and Detection
GATE CS 2018MCQ2 marksMedium (estimate)
GATE CS 2018, Q.49 (CS Q.39)
In a system, there are three types of resources: E, F and G. Four processes P0, P1, P2 and P3 execute concurrently. At the outset, the processes have declared their maximum reso...
Deadlock Prevention, Avoidance and Detection
GATE CS 2017 Set 1MCQ2 marksMedium (estimate)
GATE CS 2017 Set 1, Q.27 (CS Q.27)
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks...
Deadlock Prevention, Avoidance and Detection · Process Synchronization and Concurrency
GATE CS 2017 Set 2MCQ2 marksEasy (estimate)
GATE CS 2017 Set 2, Q.33 (CS Q.33)
A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below: | Process | Current Allocation | Maximum Requir...
Deadlock Prevention, Avoidance and Detection
GATE CS 2015 Set 2MCQ1 markMedium (estimate)
GATE CS 2015 Set 2, Q.33 (CS Q.23)
A system has 6 identical resources and $N$ processes competing for them. Each process can request at most 2 resources. Which one of the following values of $N$ could lead to a d...
Deadlock Prevention, Avoidance and Detection
GATE CS 2015 Set 3MCQ2 marksEasy (estimate)
GATE CS 2015 Set 3, Q.62 (CS Q.52)
Consider the following policies for preventing deadlock in a system with mutually exclusive resources: I. Processes should acquire all their resources at the beginning of execut...
Deadlock Prevention, Avoidance and Detection
GATE CS 2014 Set 1MCQ2 marksMedium (estimate)
GATE CS 2014 Set 1, Q.41 (CS Q.31)
An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The ta...
Deadlock Prevention, Avoidance and Detection
GATE CS 2014 Set 3NAT2 marksEasy (estimate)
GATE CS 2014 Set 3, Q.41 (CS Q.31)
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never aris...
Deadlock Prevention, Avoidance and Detection

Questions

Other topics of Operating Systems