← Back to 7. Deadlocks
📝 Single Instance of Each Resource Type Deadlock Detection
📖 From Operating System • 7. Deadlocks • 43 questions available
Practice MCQs for Single Instance of Each Resource Type Deadlock Detection. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.
🔄 Last updated: 2026-07-11
📝 Sample Questions
Q1. For which type of resource system is the Wait-For Graph algorithm specifically designed?
🔹 A. Systems with multiple instances of each resource.
🔹 B. Systems with only one instance of each resource type.
🔹 C. Systems with no resource sharing.
🔹 D. Systems with dynamic resource creation.
💡 Difficulty: easy | ✅ Correct: B
Q2. What does an edge from Pi to Pj in a Wait-For Graph signify?
🔹 A. Pi is holding a resource needed by Pj.
🔹 B. Pi is waiting for Pj to release a resource.
🔹 C. Pj is waiting for Pi to release a resource.
🔹 D. Pi and Pj are competing for the same free resource.
💡 Difficulty: medium | ✅ Correct: B
Q3. How is an edge Pi → Pj formed in the Wait-For Graph?
🔹 A. If Pi requests any resource.
🔹 B. If Pj releases any resource.
🔹 C. If the RAG contains edges Pi → Rq and Rq → Pj for some resource Rq.
🔹 D. If Pi and Pj are in the same priority queue.
💡 Difficulty: hard | ✅ Correct: C
⬆️ View all questions in the quiz below