Register

Modified GATE CSE 2017 Set 2 | Question: 33 (MSQ Version)

971 views
2 votes
2 votes

** MSQ **


A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below:

 

Which of the following best describes the system?

  1. Safe state P3 → P2 → P1 and P3 → P1 → P2 exists

  2. Currently not in a deadlock

  3. Deadlock never possible as safe states are present

  4. Deadlock is possible in future, even tough we have safe state as of now

 

User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

28 votes
28 votes
7 answers
1
Arjun asked Feb 14, 2017
14,044 views
GATE CSE 2017 Set 2 | Question: 33
A system shares $9$ ... describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked
A system shares $9$ tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below:$$\begin{array}{ccc} \textbf{Process} &...
User Avatar
23 votes
23 votes
5 answers
3
Kathleen asked Sep 29, 2014
26,981 views
GATE CSE 1993 | Question: 7.9, UGCNET-Dec2012-III: 41
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? $7$ $9$ $10$ $13$ $15$
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$ respective...
User Avatar
24 votes
24 votes
4 answers
4
Kathleen asked Sep 13, 2014
5,539 views
GATE CSE 1992 | Question: 02-xi
A computer system has $6$ tape devices, with n processes competing 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: $2$ $3$ $4$ $1$
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guarant...
User Avatar
Link Copied!