Operating Systems - Page Replacement - FIFO, LRU, Optimal Algorithm
Given a system with 4 page frames and a reference string, which algorithm would likely cause the most page faults if the reference string exhibits strong locality of reference?
Given a system with 4 page frames and a reference string, which algorithm would likely cause the most page faults if the reference string exhibits strong locality of reference?
easy🔍 Pattern Recognition Q2 of Q15
Step-by-Step Solution
Solution:
Step 1: Analyze locality impact
LRU benefits from locality by keeping recently used pages. Optimal always minimizes faults by definition. FIFO ignores usage patterns and evicts oldest pages, causing more faults with locality.Final Answer:
Option B -> Option BQuick Check:
FIFO ignores locality, causing more faults [OK]
Quick Trick: FIFO ignores usage, bad for locality-heavy strings [OK]
Common Mistakes:
MISTAKES- Assuming LRU causes most faults with locality
- Confusing Optimal with FIFO in practice
- Believing Clock is worse than FIFO here
Trap Explanation:
PITFALL- Candidates often overlook FIFO's weakness with locality, mistakenly blaming LRU or Clock.
Interviewer Note:
CONTEXT- Checks understanding of algorithm behavior with locality of reference.
Master "Page Replacement - FIFO, LRU, Optimal Algorithm" in Operating Systems
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Operating Systems Quizzes