Bird
Raised Fist0

Which of the following statements about the Banker's Algorithm is INCORRECT?

medium🐞 Bug Identification Q14 of Q15
Operating Systems - Banker's Algorithm - Safe State & Resource Allocation
Which of the following statements about the Banker's Algorithm is INCORRECT?
AThe algorithm can guarantee deadlock avoidance only if the system starts in a safe state.
BThe Need matrix is calculated as Allocation minus Maximum demand for each process.
CIf a resource request leads to an unsafe state, the request is denied to prevent deadlock.
DThe algorithm simulates resource allocation to check if the system remains in a safe state before granting requests.
Step-by-Step Solution

  1. Step 1: Understand the Need matrix definition

    Need = Maximum demand - Allocation, not Allocation - Maximum demand.

  2. Step 2: Verify other statements

    A is correct; starting in a safe state is necessary.
    C is correct; unsafe requests are denied.
    D is correct; simulation is core to the algorithm.

  3. Final Answer:

    Option B -> Option B

  4. Quick Check:

    Remember Need = Max - Allocation, not the reverse.
Quick Trick: Need = Max demand minus Allocation [OK]
Common Mistakes:
MISTAKES
  • Mixing up Need matrix calculation
  • Assuming algorithm works from unsafe states
  • Believing unsafe requests are sometimes granted
Trap Explanation:
PITFALL
  • Option B is a subtle but critical formula error. Other options are true and often confused with misconceptions about initial states and request handling.
Interviewer Note:
CONTEXT
  • Tests candidate's precise understanding of key Banker's Algorithm components and formulas.
Master "Banker's Algorithm - Safe State & Resource Allocation" in Operating Systems

2 interactive learning modes - each teaches the same concept differently

SolutionTrace

Want More Practice?

15+ quiz questions · All difficulty levels · Free

Free Signup - Practice All Questions
More Operating Systems Quizzes
Deadlock - Four Necessary Conditions (Coffman) - Deadlock - Four Necessary Conditions (Coffman) - Quiz 11easy FCFS Scheduling - Convoy Effect & Waiting Time - FCFS Scheduling - Convoy Effect & Waiting Time - Quiz 8hard FCFS Scheduling - Convoy Effect & Waiting Time - FCFS Scheduling - Convoy Effect & Waiting Time - Quiz 10hard Page Replacement - FIFO, LRU, Optimal Algorithm - Page Replacement - FIFO, LRU, Optimal Algorithm - Quiz 10hard Semaphore vs Mutex - When to Use Which - Semaphore vs Mutex - When to Use Which - Quiz 9hard Shortest Job First (SJF) - Preemptive vs Non-Preemptive - Shortest Job First (SJF) - Preemptive vs Non-Preemptive - Quiz 9hard Starvation vs Deadlock vs Livelock - Differences & Examples - Starvation vs Deadlock vs Livelock - Differences & Examples - Quiz 9hard TLB - Translation Lookaside Buffer & Effective Access Time - TLB - Translation Lookaside Buffer & Effective Access Time - Quiz 13medium Thrashing - Working Set Model & Prevention - Thrashing - Working Set Model & Prevention - Quiz 14medium Thrashing - Working Set Model & Prevention - Thrashing - Working Set Model & Prevention - Quiz 9hard