1 votes 1 votes ankit_thawal asked Jan 19, 2018 ankit_thawal 315 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply shriram s 1 commented Jan 19, 2018 reply Follow Share Since 5 process request 3 instances each, total remaining instances will be 27-15=12. max value of n such that each of n has 4 instances is: 3n+1<=12 (each of n processes assigned with 3 instances(as max requirement is 4) and at least 1 instance should be left out to avoid deadlock) n<=3.66 max value of n can be 3. 0 votes 0 votes MiNiPanda commented Jan 19, 2018 i edited by MiNiPanda Jan 19, 2018 reply Follow Share Shriram why aren't we doing the same way for those 5 processes? Like why are you accepting their requests and allocating them with 3 resources each? Why can't we allocate 2 resources for the same reason that you are applying for the n processes? 1 votes 1 votes saxena0612 commented Jan 19, 2018 reply Follow Share @ MiNiPanda Your methodology looks fine to me. Here is my work : $\rightarrow$ $ 5 \times 2+n \times 3+1\leq 26$ $\rightarrow$ $3n+1\leq 16$ $\rightarrow n \leq\color{Red}5$ So, $5$ Processes $4$ Resources Allocate $15$ $5$ Processes $3$ Resources Allocate $10$ $15+10+1=26$ (No deadlock) 1 votes 1 votes MiNiPanda commented Jan 19, 2018 reply Follow Share So it is coming 5 right? 1 votes 1 votes braindead commented Jan 19, 2018 reply Follow Share Yeah, i too thought of the same. The ans then woud be n=5. 0 votes 0 votes shriram s 1 commented Jan 19, 2018 reply Follow Share My bad. I misread the question. I thought it was allocation instead of request. Now I see the point. 0 votes 0 votes Please log in or register to add a comment.