4,355 views
3 3 votes

Consider a system with processes P0, P1,P2, . . . .  P99, P100, each process requires maximum of 4 resources. System has allocated 2 resources to each process. The minimum number of resources should release such that above system is deadlock free is _____

2 Answers

Best answer
3 3 votes
For a system to be deadlock free ,

Sum of max need of processes < No. of processes + No. of resources ........ (i)

here System has allocated 2 resources to each process , and Total number of process = 101

so max need of processes = 101 * 2 = 202

let number of resources = R

so from (i) we get, 202 < 101 + R

101 < R

that means the minimum number of resources  should be 102 .
• edited by
1 1 vote

System needs to release just 2 resources (and no less) to enter a safe state. This will allow one of the processes to complete and free all 4 resources it was using. Clearly, a safe sequence exists now.

(These 4 resources will help complete 2 more processes, and so on…)

​
Answer:
Position:
Show:

Related questions

1 1 vote
0 0 answers
1.2k
1.2k views
lolalo asked Aug 19, 2022
1,177 views
Definition of a set of deadlocked Processes:“A set of processes is deadlocked if each process in the set is waiting for an event that only another process in the set can ...
1 1 vote
1 1 answer
1.4k
1.4k views
2 2 votes
4 4 answers
856
856 views
GO Classes asked Feb 12
856 views
A system has $5$ processes and $k$ instances of a resource $R$. Assume each process requires a maximum of $2$ instances of $R$. A process can request or release only one...
0 0 votes
2 2 answers
412
412 views
Shubham Sharma 2 asked Sep 9, 2025
412 views
Read the below passage and answer the questions.The Banker's Algorithm is a critical deadlock avoidance method in operating systems, designed to facilitate resource alloc...