📝 Resource Allocation Graph Algorithm in Deadlock Avoidance

📖 From Operating System • 7. Deadlocks • 49 questions available

Practice MCQs for Resource Allocation Graph Algorithm in Deadlock Avoidance. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-11

Easy Questions

Medium Questions

Hard Questions

📝 Sample Questions

Q1. What is the primary condition for applying the resource-allocation graph algorithm described for deadlock avoidance?

🔹 A. Each resource type must have multiple instances.

🔹 B. Each resource type must have exactly one instance.

🔹 C. The system must use banker's algorithm.

🔹 D. Processes must not declare resource needs beforehand.

💡 Difficulty: easy | ✅ Correct: B

Q2. Why must claim edges generally be established a priori?

🔹 A. To reduce the complexity of cycle detection.

🔹 B. To allow the system to know the maximum potential resource needs of each process.

🔹 C. To prevent processes from requesting resources dynamically.

🔹 D. To ensure all resources are pre-allocated.

💡 Difficulty: medium | ✅ Correct: B

Q3. Process P2 requests R2. R2 is free. However, granting it creates a cycle. What should the system do?

🔹 A. Grant the request because R2 is free.

🔹 B. Deny the request to prevent entering an unsafe state.

🔹 C. Terminate P2 immediately.

🔹 D. Ignore the cycle and proceed.

💡 Difficulty: hard | ✅ Correct: B

⬆️ View all questions in the quiz below

🔗 Related Topics

📝 Computer System Architecture 📝 Computer System Organization 📝 Computing Environments 📝 Kernel Data Structures 📝 Memory Management

🚀 Start Quiz 📝 Practice Mode