1
GATE CSE 2022
MCQ (More than One Correct Answer)
+1
-0
Which of the following statements is/are TRUE with respect to deadlocks?
2
GATE CSE 2018
Numerical
+1
-0
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 released only one at a time. The largest value of $$K$$ that will always avoid deadlock is ____.
Your input ____
3
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+1
-0.3
A system has 6 identical resources and N processes competing for them. Each process can request atmost 2 resources. Which one of the following values of N could lead to a deadlock?
4
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?
Questions Asked from Deadlocks (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
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