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. GATE CSE 1996 Operating Systems - Deadlocks Question 11 English
(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. GATE CSE 1994 Operating Systems - Deadlocks Question 12 English
(a) Find if the system is in a deadlock state.
(b) Otherwise, find a safe sequence.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP