Free Deadlocks lessonsDeadlocks · Stage 1 · Avoidance and detection · Step 1
Safe states and the banker's algorithm
Work out whether a state is safe, and find the order in which every process can finish. About 15 minutes.
A system is in an unsafe state. What is true?
- ADeadlock is possible, but not certain
- BThe system is already deadlocked
- CNothing, it's identical to a safe state
Show the answer
Deadlock is possible, but not certain. No safe sequence exists, so the system can't guarantee everyone finishes, but processes might never use their full claims.
4 questions on this idea
Short questions that apply the idea to new cases: trace it, work out a number, put steps in order. A wrong answer explains itself.
Answer them in your browserFree account, no card. Your progress is saved, and the idea comes back in a quick review later.
Sign up free to solve