Question

consider a system having m resources of the same type these resources are shared 3process​

Answer 1

Answer:

Let the resources needed by P1 = R1 = 3, the number of resources needed by P2 = R2 = 4 and so on.

Minimum resources required to ensure that deadlock will never occur = (R1-1) + (R2-1) + (R3-1) + 1 = (3-1) + (4-1) + (6-1) + 1 = 11

Answer 2

Answer:

Consider the peak demand situation of resources (A,B,C)=(3,4,6).

For a specific number of resources,to conclude there is possibility of deadlock (not deadlock free), we have to find at least one resource allocation which results in deadlock, that is an allocation that cannot completly satisy the resource requirements of even one process .