Question

A resource-allocation graph contains a cycle, but at least one resource type in the cycle has multiple instances. What can be concluded?

A A deadlock definitely exists because any cycle is sufficient.
B No deadlock can exist because multiple instances always break cycles.
C The cycle proves starvation but says nothing about deadlock.
D The cycle alone is not sufficient to prove deadlock with multiple resource instances.
E The OS must immediately terminate every process in the cycle.
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)