What distinguishes deadlock detection from deadlock avoidance?
Correct! Well done.
Incorrect.
The correct answer is D) Detection periodically checks the system state (e.g., via a resource-allocation graph) to identify deadlocks that have already formed and then recovers; avoidance proactively decides whether granting a request keeps the system in a safe state
Correct Answer
Detection periodically checks the system state (e.g., via a resource-allocation graph) to identify deadlocks that have already formed and then recovers; avoidance proactively decides whether granting a request keeps the system in a safe state
Avoidance algorithms like the Banker's Algorithm decide in advance whether a resource request could ever lead to deadlock and deny risky requests. Detection algorithms let the system run and periodically check for cycles or unsafe states, then take recovery action (e.g., killing or rolling back a process).