5,191 views
7 votes
7 votes

Consider a system having "n" resources of same type. These resources are shared by 3 processes, A, B, C. These have peak demands of 3, 4, and 6 respectively. For what value of "n" deadlock won't occur

  1. 15
  2. 9
  3. 10
  4. 13

2 Answers

Best answer
15 votes
15 votes
Apply PigeonHole principle.
value of n will be (3-1) + (4-1) + (6-1) + 1= 11
but here no option which is 11.

now lets try 2nd way.

it may possible that after completion of task processes don't want to release resource (Yes it is not written any where that processes must release resources after Execution) so we can think like this also.

To overcome this situation we have to allocate all required resources to each process at very stating. i.e. 3+4+6 = 13

13 satisfy both cases. so in worst it should be answer.
selected by
1 votes
1 votes
Option C will be the right opton for it.Such problem is explained earlier.
Answer:

Related questions

8 votes
8 votes
4 answers
1
ajit asked Oct 5, 2015
6,825 views
When a process is rolled back as a result of deadlock the difficulty which arises isStarvationSystem throughputLow device utilizationCycle stealing
1 votes
1 votes
2 answers
2