A system consists of 10 units of resource class Ru. The resource needs of three user processes P1, P2 and P3 are like this                   

 Using Banker's algorithm, define if the projected allocation state is safe and if the request of P1 will be granted or not.             

 Ans: From the given data:

  Total_alloc=[7]

 Total_exist=[10]

The projected allocation state is feasible because the total allocation in it does not exceed the number of resource units of Ru. As P3 is two units short of its maximum needs and two unallocated units exits in the system, therefore P3 can complete. This will release the resources allocated to it, that is, 5 resources. Here now P1 can complete since the number of unallocated units of Ru exceeds the units required to satisfy its maximum need then P2 can be completed. So the processes can finish in the sequence P3, P1, and P2. Therefore projected allocation state is safe so algorithm will grant the request that is made by P1.