Back to the 2023 paper

Module 4: Deadlocks

20234m

Justify the following statement: "Cycle in resource allocation graph does not always imply the occurrence of deadlock".

Worked SolutionAI Assisted

Justification: Cycle in RAG implies deadlock only with single instance per resource type. With multiple instances, a cycle may not imply deadlock because another instance may satisfy request and break cycle. Example: 2 instances of R1, P1 holds R1, P2 holds R1, each requests other — cycle exists but resources can be allocated to break it. Deadlock requires cycle + each resource in cycle has only one instance (or unsatisfiable request). Hence cycle is necessary but not sufficient for multiple instances.

Similar questions

Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.