NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
VISIT NOW

GATE CSE

Deadlocks

Operating Systems

Previous Years Questions

Marks 1

More
Which of the following statements is/are TRUE with respect to deadlocks?
GATE CSE 2022
Consider the following threads, T1, T2 and T3 executing on a single processor, synchronized using three binary semaphore...
GATE CSE 2022
Consider a system with $$3$$ processes that share $$4$$ instances of the same resource type. Each process can request a ...
GATE CSE 2018
A system has 6 identical resources and N processes competing for them. Each process can request atmost 2 resources. Whic...
GATE CSE 2015 Set 2
A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maxim...
GATE CSE 1998

Marks 2

More
Consider the following pseudocode, where S is a semaphore intialized to 5 in line#2 an counter is a shared variable inti...
GATE CSE 2021 Set 1
In a system, there are three types of resources: $$E, F$$ and $$G.$$ Four processes $${P_0},$$ $${P_1},$$ $${P_2}$$ and...
GATE CSE 2018
Consider a non-negative counting semaphore $$S.$$ The operation $$P(S)$$ decrements $$S,$$ and $$V(S)$$ increments $$S.$...
GATE CSE 2016 Set 2
Consider the following policies for preventing deadlock in a system with mutually exclusive resources. $$\,\,\,\,\,\,\,...
GATE CSE 2015 Set 3
An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource ty...
GATE CSE 2014 Set 1
Consider the procedure below for the Producer-Consumer problem which uses semaphores: semaphore n = 0; semaphore s = 1; ...
GATE CSE 2014 Set 2
A system has n resources R0,.....,Rn-1, and k processes P0,.....,Pk-1. The implementation of the resource request logic ...
GATE CSE 2010
Consider a system with 4 types of resources R1 (3 units), R2 (2 units), R3 (3 units), R4 (2 units). A non-preemptive res...
GATE CSE 2009
Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?
GATE CSE 2008
A single processor system has three resource types X, Y and Z, which are shared by three processes. There are 5 units of...
GATE CSE 2007
Consider the following snapshot of a system running n processes. Process i is holding xi instances of a resource R, for ...
GATE CSE 2006
Suppose n processes, P1,......., Pn share m identical resource units, which can be reserved and released one at a time. ...
GATE CSE 2005
Which of the following is NOT a valid deadlock prevention scheme?
GATE CSE 2000
An operating system contains 3 user processes each requiring 2 units of resource R.The minimum number of units of R such...
GATE CSE 1997
Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C, which have ...
GATE CSE 1993
A computer system has 6 tape drives, with n process completing for them. Each process may need 3 tape drives. The maximu...
GATE CSE 1992

Marks 5

More
A computer system uses the Banker’s Algorithm to deal with deadlocks. Its current state is shown in the tables below, wh...
GATE CSE 1996
Consider the resource allocation graph given in the figure. (a) Find if the system is in a deadlock state. (b) Otherwis...
GATE CSE 1994

Joint Entrance Examination

JEE Main JEE Advanced WB JEE

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

Medical

NEET

CBSE

Class 12