in Operating System edited by
669 views
1 vote
1 vote

A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 resources. Then, the maximum value of ‘N’ is _______.

in Operating System edited by
669 views

4 Comments

is this any formula?
0
0
thanks a lott dear...i understood now...  :)
0
0
It is formula but don't follow it blindly,find intuition in that
0
0

1 Answer

0 votes
0 votes
As grouping of first 3 processes require 6 resource we can write a+b+c=6; and p be total no. of processes.

and also

(a-1)+(b-1)+(c-1)+(p-3)2+1<=10

so ans will be 6

4 Comments

thanks
0
0
are you sure that first process definitely get atleast one resource because here it is only mention that group of first three get 6 resource. It can happen P1 require 0R, P2 require 3R, P3 require 3R. In this case 100% deadlock occur if there will be 6 process. So i think answer will be 5 process.
0
0
Ans will be 5.
0
0

Related questions