in Operating System edited by
33,878 views
49 votes
49 votes

A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock?

  1. $1$
  2. $2$
  3. $3$
  4. $4$
in Operating System edited by
33.9k views

4 Comments

Did gate gave bonus marks for this question?
1
1
0
0
They made wrong question. Even with 4 process it can never go in deadlock. All philosophy and whatnot but the question is wrong. Answer should be 6.
0
0

10 Answers

0 votes
0 votes
Nos of Resources=R=6

nos of processes=N

Max demand=P=2

Now deadlock will not occur if R>=N*(P-1)+1 which gives N <=5, Now the max option given  4  which is taken as the solution.

Hence the option D is correct.
0 votes
0 votes

I am mentioning few Relevent comments to understand this que from a lot of comments of this que.

Answer is 4 But i didnt think same it should mark to alll 

edited by
Answer:

Related questions