← All topics
Quiz: Deadlocks: questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. Which is NOT one of the four necessary conditions for deadlock?
- Q2. In the Banker's algorithm, Need is calculated as:
- Q3. Always requesting resources in increasing numbered order prevents deadlock by breaking:
- Q4. An unsafe state means:
- Q5. Available = (2, 1), P has Allocation (1, 0) and Max (3, 2). Can P finish right now?
- Q6. In the lesson's Banker's example (Available = (3, 3, 2)), which other process besides P1 could safely be chosen first?
- Q7. How does a system detect a deadlock among single-instance resources?
- Q8. Requiring every process to request all its resources at once prevents deadlock by breaking which condition?
- Q9. Most desktop operating systems simply ignore deadlocks and rely on the user to restart. What is this approach called?
- Q10. Which statement best separates deadlock from starvation?