Question

In a Resource Allocation Graph with single-instance resources, a cycle P1→R1→P2→R2→P1 exists. What does this indicate?

Q: Answer-In a Resource Allocation Graph with single-instance resources, a cycle P1→R1→P2→R2→P1 exists. What d...

For single-instance resource types, a cycle in the Resource Allocation Graph is both necessary and sufficient for deadlock. With multiple-instance resources, a cycle is necessary but NOT sufficient another process might still release a needed instance, breaking the cycle without deadlock actually occurring.