Deadlock

Question 1
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 _________.
A
2
B
3
C
4
D
5
       Operating-Systems       Deadlock       Gate 2018
Question 1 Explanation: 
No. of process = 3
No. of resources = 4
Let’s distribute each process one less than maximum demands i.e., (k-1) resources.
So, for three processes, 3(k – 1) resources.
For deadlock avoidance provide an additional resource to any one of the process.
∴ Total resources required to avoid deadlock in any case is 3(k – 1) + 1 = 3k – 2
Now this 3k – 2 should be less than equal to available no. of resources, i.e.,
3k – 2 ≤ 4
k ≤ 2
So maximum value of k = 2
Question 2
 
A
The system is in safe state.
B
The system is not in safe state, but would be safe if one more instance of E were available.
C
The system is not in safe state, but would be safe if one more instance of F were available.
D
The system is not in safe state, but would be safe if one more instance of G were available.
       Operating-Systems       Deadlock       Gate 2018
Question 2 Explanation: 
〈E,F,G〉=〈3,3,0〉

Safe sequence: 〈P0, P2, P1, P3
P0: P0can be allotted 〈3,3,0〉. After completion Available = 〈4,3,1〉
P2: P2can be allotted 〈0,3,0〉. After completion Available = 〈5,3,4〉
P1: P1can be allotted 〈1,0,2〉. After completion Available = 〈6,4,6〉
P3: P3can be allotted 〈3,4,1〉. After completion Available = 〈8,4,6〉
Question 3
 
A
Safe, Deadlocked
B
Safe, Not Deadlocked
C
Not Safe, Deadlocked
D
Not Safe, Not Deadlocked
       Operating-Systems       deadlock       GATE 2017(set-02)
Question 3 Explanation: 

Available: (9 - (3 + 1 + 3)) = 2, P3 can be satisfied, New available = 3 + 2 = 5
Now, P2 can be satisfied. New available: 5 + 1 = 6.
Now, P1 can be satisfied. Thus safe sequence: P3→ P2 → P1
That is not deadlocked.
Question 4
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?
A
1
B
2
C
3
D
6
       Operating-Systems       Deadlock       GATE 2015 -(Set-2)
Question 4 Explanation: 
6. Five processes holding 1 instance each and 1 process holding 2 instances leads to deadlock.
Question 5
A
Any one of I and III but not II or IV
B
Any one of I, III, and IV but not II
C
Any one of II and III but not I or IV
D
Any one of I, II, III, and IV p
       Operating-Systems       Deadlock       GATE 2015(Set-03)
Question 5 Explanation: 
All are deadlock prevention strategies.
Question 6
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________.
A
7
B
8
C
9
D
10
       Operating-Systems       Deadlock       Gate 2014 Set -03
Question 6 Explanation: 
(3*2 tape units) + 1 tape unit = 7
Question 7
 
A
n = 40, k = 26
B
n = 21, k = 12
C
n = 20, k = 10
D
n = 41, k = 19
       Operating-Systems       Deadlock       2010
Question 7 Explanation: 
Consider the case where i = 10 & i = 11, n = 21 & k = 12
P10 requests R10 & R11
P11 requests R10 & R8
Hence P10 & P11 inorder in deadlock.
Question 8
 
A
All processes will finish without any deadlock.
B
Only P1 and P2 will be in deadlock.
C
Only P1 and P3 will be in a deadlock.
D
All three processes will be in deadlock.
       Operating-Systems       Deadlock       2009
Question 8 Explanation: 
Process P1:

t=0; req R2-2
t=1; req R3-1
t=3; req R1-2
t=5; release R2-1
& R1-1
t=7; release R3-1
t=8; req R4-2
t=10; finish:After completion of P, it releases all the resources.
Process P2:
t=0; req R3-2
t=2; req R4-1
t=4; req R1-1
t=6; releases R3-1
t=8; finishes
It releases all the resources.
Process P3:

t=0; req R4-1
t=2; req R1-2
t=5; releases R1-2
t=7; req R2-1
t=8; req R3-1
t=9; finishes
It releases all the resources.
All processes will finish without any deadlock.
Question 9
Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?
A
In deadlock prevention, the request for resources is always granted if the resulting state is safe
B
In deadlock avoidance, the request for resources is always granted if the result state is safe
C
Deadlock avoidance is less restrictive than deadlock prevention
D
Deadlock avoidance requires knowledge of resource requirements a priori
       Operating-Systems       Deadlock       Gate-2008
Question 9 Explanation: 
Deadlock prevention scheme handles deadlock by making sure that one of the four necessary conditions don't occur. So, it may be the case that a resource request might be rejected even if the resulting state is safe. Hence, option (A) is false.
Question 10
An operating system implements a policy that requires a process to release all resources before making a request for another resource. Select the TRUE statement from the following:
A
Both starvation and deadlock can occur
B
Starvation can occur but deadlock cannot occur
C
Starvation cannot occur but deadlock can occur
D
Neither starvation nor deadlock can occur
       Operating-Systems       Deadlock       Gate 2008-IT
Question 10 Explanation: 
Starvation can occur as each time a process requests a resource it has to release all its resources.
Now, maybe the process has not used the resources it released yet. This may happen again when the process requests another resource.
So, the process starved for proper utilization of resources.
Deadlock will not occur as it is one of the deadlock prevention scheme.
Question 11

Consider the following snapshot of a system running n processes. Process i is holding xi instances of a resource R, 1 ≤ i ≤ n. Currently, all instances of R are occupied. Further, for all i, process i has placed a request for an additional yi instances while holding the xi instances it already has. There are exactly two processes p and q such that yp = yq = 0. Which one of the following can serve as a necessary condition to guarantee that the system is not approaching a deadlock?

A
min (xp, xq) < maxk≠p,qyk
B
xp + xq ≥ mink≠p,qyk
C
max (xp, xq) > 1
D
min (xp, xq) > 1
       Operating-Systems       Deadlock       Gate-2006
Question 11 Explanation: 
Deadlock refers stops the execution of process due to non-availability of resources.
→ When two (or) more processes waiting for another process to release the resources.
→ P and Q can execute if they have sufficient resources, they don’t wait for extra resources (i.e., Xp+ Xq) required.
→ Option B can satisfies the corresponding equation i.e., Xp+ Xq >= min(Yk) where k != p and k != q.
Here we have sufficient resources.
Question 12

Suppose n processes, P1, …., Pn share m identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process Pi is si, where s> 0. Which one of the following is a sufficient condition for ensuring that deadlock does not occur?

A
B
C
D
       Operating-Systems       Deadlock       Gate-2005
Question 12 Explanation: 
In the extreme situation, we have si - 1 resources and we require one more resource.
If the deadlock will never occcur in the corresponding process then the following condition be true.
Question 13
Which of the following is NOT a valid deadlock prevention scheme?
A
Release all resources before requesting a new resource
B
Number the resources uniquely and never request a lower numbered resource than the last one requested
C
Never request a resource after releasing any resource
D
Request and all required resources be allocated before execution
       Operating-Systems       Deadlock       Gate-2000
Question 13 Explanation: 
Given statement is wrong. We can request a resource after releasing any resource.
Question 14
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?
A
6
B
5
C
4
D
3
       Operating-Systems       Deadlock       Gate-1998
Question 14 Explanation: 
Each process needs 2 drives. So for deadlock just give each process one drive. So total 6 process can be given 1 drive each and can cause deadlock. So to break deadlock just reduce 1 process.
So maximum no. of process for the system to be deadlock free is 5.
Question 15
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
A
3
B
5
C
4
D
6
       Operating-Systems       Deadlock       Gate-1997
Question 15 Explanation: 
For the system to cause deadlock give each process 1 resource less than they require. Since in this case they require 2 resource each, so just give them 1 resource each. So if at max if 3 resource will be available then there can be deadlock. So by adding one more resource deadlock will never occur. So in total minimum 4 resources are required so that deadlock will never occur.
Question 16
A solution to the Dining Philosophers Problem which avoids deadlock is
A
ensure that all philosophers pick up the left fork before the right fork
B
ensure that all philosophers pick up the right fork before the left fork
C
ensure that one particular philosopher picks up the left fork before the right fork, and that all other philosophers pick up the right fork before the left fork
D
None of the above
       Operating-Systems       Deadlock       Gate-1996
Question 16 Explanation: 
In the Dining philosopher problem, each philosopher needs exactly two chopsticks to eat food but the problem is: each philosopher is going to take one chopstick at a time, which is placed at its right-hand side or at its left-hand side, but remember all should choose in the same manner like if first one chooses in a clockwise manner then each one should choose in clockwise, this type of picking cause, a circular waiting loop because each one is depending on other. This is also called as circular waiting and it leads to deadlock.
To avoid this, atleast one philosopher should choose its first chopstick in different way so that circular loop is not formed.
Question 17
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?
A
7
B
9
C
13, 15
D
13
E
15
       Operating-Systems       Deadlock       Gate-1993
Question 17 Explanation: 
A requires 3, B-4, C-6;
→ If A have 2, B have 3, C have 5 then deadlock will occur i.e., 2+3+5=10.
→ If we have one extra resource then deadlock will not occur i.e., 10+1=11.
→ If we have equal (or) more than 11 resources then deadlock will never occur.
Question 18
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?
A
7
B
9
C
13, 15
D
13
E
15
       Operating-Systems       Deadlock       Gate-1993
Question 18 Explanation: 
A requires 3, B-4, C-6;
→ If A have 2, B have 3, C have 5 then deadlock will occur i.e., 2+3+5=10.
→ If we have one extra resource then deadlock will not occur i.e., 10+1=11.
→ If we have equal (or) more than 11 resources then deadlock will never occur.
Question 19
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:
A
2
B
3
C
4
D
1
       Operating-Systems       Deadlock       Gate-1992
Question 19 Explanation: 
Lets give 2 tape driver to each process, so that there will be deadlock. So 3 processes will be given two drives each so that there will be deadlock. So to avoid deadlock maximum no. of process should be 1 less than the minimum no. of process that will cause deadlock. So for n=2, the system is guaranteed to be deadlock free.
There are 19 questions to complete.