New Enroll in RBI Grade B New Batch - Starts on May 21

    Question

    Which of the following statements is true about

    deadlocks in an operating system?
    A Deadlocks occur when multiple processes are competing for a single CPU core in a multithreaded environment Correct Answer Incorrect Answer
    B Deadlocks can be avoided by ensuring that no process holds resources while waiting for additional ones. Correct Answer Incorrect Answer
    C Deadlocks can only occur when using the Round Robin CPU scheduling algorithm Correct Answer Incorrect Answer
    D Deadlocks are resolved by the Least Recently Used (LRU) page replacement algorithm. Correct Answer Incorrect Answer
    E Deadlocks cannot occur if the system uses multithreading instead of multiprocessing. Correct Answer Incorrect Answer

    Solution

    Deadlocks arise when a set of processes is blocked because each process is holding a resource and waiting for another resource that is currently held by another process in the set. This creates a circular wait condition. Deadlock avoidance is a strategy to ensure that the system never enters a deadlocked state. One such method is implementing the "No Hold and Wait" condition, where processes are required to request all required resources simultaneously or release currently held resources before requesting new ones. This approach prevents the circular wait condition from forming, thereby avoiding deadlocks. For example, in resource allocation, the Banker's Algorithm is a practical method for deadlock avoidance. Why Other Options Are Incorrect :

    1. Deadlocks occur when multiple processes are competing for a single CPU core in a multithreaded environment : This describes resource contention, not deadlock. Deadlocks involve resources like files, printers, or memory, not CPU cores specifically.
    2. Deadlocks can only occur when using the Round Robin CPU scheduling algorithm : Deadlocks are independent of CPU scheduling algorithms and depend on resource allocation policies.
    3. Deadlocks are resolved by the Least Recently Used (LRU) page replacement algorithm : LRU is a page replacement algorithm used in memory management, not for resolving deadlocks.
    4. Deadlocks cannot occur if the system uses multithreading instead of multiprocessing : Deadlocks can occur in both multithreading and multiprocessing if resource allocation policies create circular waits.

    Practice Next