Question:medium

What is a safe state in deadlock avoidance?

Show Hint

Look for the option about an ordering that lets every process finish.
Updated On: Jul 2, 2026
  • A state where no processes are currently using resources
  • A state where processes must request resources in a specific sequence
  • A state where the system can allocate resources to all processes in some order without leading to deadlock
  • A state where at least one process is currently blocked
Show Solution

The Correct Option is C

Solution and Explanation

The heart of a safe state is the existence of a finishing order. Picture the processes lined up so that the first can complete with the resources on hand, release them, then the next can complete, and so on down the line.

If even one such safe sequence exists, no deadlock can trap the system, because there is always a way to satisfy everyone eventually.

That matches the option describing an allocation order that lets all processes finish without deadlock.

\[\boxed{\text{System can serve all processes in some order without deadlock}}\]
Was this answer helpful?
0