What is a key limitation of the Banker's Algorithm that affects its practical use in modern operating systems?

medium🪤 Complexity Trap Q13 of Q15

Operating Systems - Banker's Algorithm - Safe State & Resource Allocation

AIt requires processes to declare their maximum resource needs in advance, which is often impractical.

BIt can only handle a single resource type, limiting its applicability.

CIt always leads to deadlocks if the system is heavily loaded.

DIt preempts resources from processes, causing starvation.

Step-by-Step Solution

Step 1: Identify Banker's Algorithm assumptions
The algorithm requires prior knowledge of maximum resource needs for each process.
Step 2: Analyze limitations
This requirement is often unrealistic in dynamic or unpredictable environments.
Step 3: Evaluate other options
B is false; Banker's Algorithm handles multiple resource types.
C is false; it avoids deadlocks rather than causing them.
D is false; it does not preempt resources.
Final Answer:
Option A -> Option A
Quick Check:
Pre-declaration of max needs is the main practical limitation.

Quick Trick: Banker's Algorithm needs max resource claims upfront [OK]

Common Mistakes:

MISTAKES

Trap Explanation:

PITFALL

Option B is a common misconception about resource types. Option C confuses avoidance with deadlock occurrence. Option D mixes up preemption with avoidance.

Interviewer Note:

CONTEXT

Tests understanding of practical constraints and assumptions behind Banker's Algorithm.

Master "Banker's Algorithm - Safe State & Resource Allocation" in Operating Systems

2 interactive learning modes - each teaches the same concept differently

Want More Practice?

15+ quiz questions · All difficulty levels · Free

More Operating Systems Quizzes