1
GATE CSE 1996
Subjective
+5
-0
A computer system uses the Banker’s Algorithm to deal with deadlocks. Its current state is shown in the tables below, where P0, P1, P2 are processes and R0, R1, R2 are resource types.
(a) Show that the system can be in this state.
(b) What will the system do on a request by process P0 for one unit of resource type R1?
![GATE CSE 1996 Operating Systems - Deadlocks Question 9 English](https://gateclass.static.cdn.examgoal.net/NDMSl4vSwoPigw2vr/e7ZTjJADuHrSZaiZU1wpAQ1HVMAZp/ZYRA2nGdG1xWpEJi8lrdjT/uploadfile.jpg)
(a) Show that the system can be in this state.
(b) What will the system do on a request by process P0 for one unit of resource type R1?
2
GATE CSE 1994
Subjective
+5
-0
Consider the resource allocation graph given in the figure.
(a) Find if the system is in a deadlock state.
(b) Otherwise, find a safe sequence.
![GATE CSE 1994 Operating Systems - Deadlocks Question 10 English](https://gateclass.static.cdn.examgoal.net/N0XOl7vCkklzHpi1K/at4rZsFJNd0DpcMBUXc6Bq3n2NMEC/2CPwtvBuLfoEkvILFliRy8/uploadfile.jpg)
(a) Find if the system is in a deadlock state.
(b) Otherwise, find a safe sequence.
Questions Asked from Deadlocks (Marks 5)
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