edited by
975 views
2 votes
2 votes

Consider a system having $’m’$ resources of the same type. These resources are shared by $3$ processes $A,B,C;$ which have peak time demands of $3,4,6$ respectively. The minimum value of $’m’$ that ensures that deadlock will never occur is

  1. $11$
  2. $12$
  3. $13$
  4. $14$
edited by

2 Answers

2 votes
2 votes

SO ANS IS: A

DEADLOCK WILL NOT HAPPEN AFTER 11 AND HIGHER THAN 11 VALUE. 

SO ANS IS 11 

Answer:

Related questions

3 votes
3 votes
2 answers
2
admin asked Apr 1, 2020
3,398 views
Which of the following scheduling algorithms could result in starvation?PriorityRound RobinFCFSNone of the above
0 votes
0 votes
2 answers
3