When to Mention Which Replacement Algorithm
⚠️ Added for clarity (not directly from source)
- - FIFO: simplest, but can show Belady's anomaly.
- - Optimal: theoretical best baseline, not implementable in practice.
- - LRU: practical locality-based approach with tracking overhead.
- - Clock/Second-Chance: low-cost LRU approximation.
- - NRU: class-based quick heuristic using referenced and modified bits.