1
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
An operating system contains 3 user processes each requiring 2 units of resource R.The minimum number of units of R such that no deadlocks will ever arise is
2
GATE CSE 1993
MCQ (Single Correct Answer)
+2
-0.6
Consider a system having m resources of the same type. These resources are
shared by 3 processes A, B and C, which have peak demands of 3, 4 and 6
respectively. For what value of m deadlock will not occur?
3
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
A computer system has 6 tape drives, with n process completing for them.
Each process may need 3 tape drives. The maximum value of n for which the
system is guaranteed to be deadlock free is:
Questions Asked from Deadlocks (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2018 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2010 (1)
GATE CSE 2009 (1)
GATE CSE 2008 (1)
GATE CSE 2007 (1)
GATE CSE 2006 (1)
GATE CSE 2005 (1)
GATE CSE 2000 (1)
GATE CSE 1997 (1)
GATE CSE 1993 (1)
GATE CSE 1992 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages