Operating Systems - Deadlock

P = {P1, P2, P3, P4} consists of all active processes in an operating system. R = {R1, R2, R3, R4} consists of single instances of distinct types of resources in the system. The resource allocation graph has the followin...

A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below: Process | Current Allocation | Maximum Requirement P1 | 3 | 7 P2 | 1 | 6 P3 | 3 | 5 Which...