Operating Systems - Page Replacement - FIFO, LRU, Optimal Algorithm
Which of the following statements about the FIFO page replacement algorithm is INCORRECT?
Which of the following statements about the FIFO page replacement algorithm is INCORRECT?
medium🐞 Bug Identification Q14 of Q15
Step-by-Step Solution
Step 1: Understand FIFO Eviction Policy
FIFO evicts the oldest loaded page, not the least recently used.Step 2: Evaluate Each Option
FIFO can suffer from Belady's anomaly where increasing frames increases page faults is correct; Belady's anomaly can occur with FIFO.
FIFO always evicts the least recently used page is incorrect; FIFO does not track recency of use.
FIFO is simple to implement with a queue data structure is correct; FIFO uses a queue for eviction order.
FIFO does not consider how frequently or recently a page was accessed is correct; FIFO ignores frequency and recency.Final Answer:
Option A -> Option AQuick Check:
FIFO evicts by arrival order, not usage recency.
Quick Trick: FIFO evicts oldest loaded page, not least recently used [OK]
Common Mistakes:
MISTAKES- Confusing FIFO with LRU eviction criteria
- Assuming FIFO tracks page usage
- Believing FIFO cannot have anomalies
Trap Explanation:
PITFALL- Option B is tempting because 'least recently used' sounds similar to 'first in', but FIFO ignores usage history.
Interviewer Note:
CONTEXT- Tests candidate's ability to distinguish FIFO from LRU and understand FIFO's limitations.
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