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

    Question

    Which of the following algorithms is most commonly used

    in Operating Systems for deadlock prevention?
    A Banker's Algorithm Correct Answer Incorrect Answer
    B Round Robin Scheduling Correct Answer Incorrect Answer
    C First-Come, First-Served Scheduling Correct Answer Incorrect Answer
    D Shortest Job Next Correct Answer Incorrect Answer
    E Least Recently Used (LRU) Correct Answer Incorrect Answer

    Solution

    Correct Option: Banker's Algorithm (A) is used in operating systems to prevent deadlocks by determining if a system can safely allocate resources to avoid deadlock situations. It ensures that processes proceed without circular waiting, a condition for deadlock. Why Other Options Are Wrong: B) Round Robin Scheduling: This is a CPU scheduling algorithm used for time-sharing systems, not for deadlock prevention. It deals with process scheduling, not resource allocation. C) First-Come, First-Served Scheduling: This is a simple scheduling algorithm where processes are executed in the order of arrival. It has no role in preventing deadlocks. D) Shortest Job Next: This is another CPU scheduling algorithm used to prioritize tasks based on their shortest execution time, which doesn’t address deadlocks. E) Least Recently Used (LRU): LRU is a page replacement algorithm in memory management, unrelated to deadlock handling.

    Practice Next