This project is a command-line simulation of two fundamental page replacement algorithms from Operating Systems: FIFO (First-In, First-Out) and LRU (Least Recently Used).
It programmatically demonstrates the performance difference between a simple and a more predictive algorithm by calculating and comparing their total page faults for a given memory reference string.
The simulation results consistently show LRU's superior performance, especially for memory access patterns with high locality.
Conclusion: LRU is a more efficient algorithm because its strategy of removing the least recently used page is a better predictor of future memory needs than FIFO's simple age-based approach.