in Operating System edited by
359 views
1 vote
1 vote

in Operating System edited by
359 views

1 Answer

0 votes
0 votes
Processes $P_1$ $P_2$ $P_3$ $P_4$ $P_5$ $\cdots$ $P_n$
Max. resource requirement $6$ $3$ $3$ $\cdots$ $3$

Then, the below equation holds for no deadlock.

$2(n-3) + 5 + 1 = 10$

$\implies 2n - 6 + 6 = 10$

$\therefore n = 5$

Is it the correct answer?

1 comment

Yes Correct.
0
0

Related questions