Unit 4: Deadlocks
Deadlock Conditions & Banker's Algorithm
14 min read · 0% complete
Explanation
A deadlock happens when processes wait for each other forever and nobody can move.
Four conditions must all hold for it to occur.
Key exam points
- All four Coffman conditions must hold
- Banker's algorithm is avoidance, not prevention
- Cycle in wait-for graph = deadlock (single instance)
Previous year questions
Apply Banker's algorithm to the given system state and determine if it is safe.
2023 · 10 marks
Practice quiz
Banker's algorithm is used for deadlock: