🏠 Home > Operating System > 7. Deadlocks > Multiple Instance Deadlock Detection
← Back to 7. Deadlocks

📝 Multiple Instance Deadlock Detection

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

Practice MCQs for Multiple Instance Deadlock Detection. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-11

13
Easy Questions
21
Medium Questions
14
Hard Questions

📝 Sample Questions

Q1. What is the primary input to the detection algorithm?

🔹 A. Current state (Available, Allocation, Request).
🔹 B. Maximum needs.
🔹 C. Past history.
🔹 D. Future predictions.

💡 Difficulty: easy | ✅ Correct: A

Q2. What is the condition `Request_i ≤ Work` checking?

🔹 A. If the process has enough resources.
🔹 B. If the system can satisfy the process's current request.
🔹 C. If the process is finished.
🔹 D. If the process is deadlocked.

💡 Difficulty: medium | ✅ Correct: B

Q3. What condition must be met to select a process Pi in Step 2 of the algorithm?

🔹 A. Finish[i] == true and Request_i ≤ Work
🔹 B. Finish[i] == false and Request_i > Work
🔹 C. Finish[i] == false and Request_i ≤ Work
🔹 D. Finish[i] == true and Request_i ≥ Work

💡 Difficulty: hard | ✅ Correct: C

⬆️ 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