Deadlocks Q.2

0. A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then

  • Option : D
  • Explanation : A system is in a safe state only if there exists a safe sequence of processes P1, P2, P3, Pn where:
    For each Pi, the resources that Pi can still request can be satisfied by the currently available resources plus the resources help by all Pj, j<i.
    If a system is in safe state, there is no deadlock.
    If the system is deadlocked, it is in an unsafe state.
    If a system is in unsafe state, there is a possibility for a deadlock.
    Avoidance: making sure the system will not enter an unsafe state.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *