Question:

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
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

Step 1: Deadlock avoidance checks whether granting a resource request keeps the system in a state from which every process can still finish.

Step 2: A state is called safe if there exists at least one ordering of the processes, a safe sequence, such that each process can get all the resources it needs and complete.

Step 3: If such an order exists, the system can hand out resources without ever getting stuck, so deadlock is avoided.

Step 4: Option (C) captures exactly this. Being idle, following a fixed request order, or having a blocked process do not define a safe state. The answer is (C).
Was this answer helpful?
0
0