Skip to content

Latest commit

 

History

History
10 lines (10 loc) · 315 Bytes

README.md

File metadata and controls

10 lines (10 loc) · 315 Bytes

Paging-and-Replacement

It is required to simulate some of paging replacement algorithms. The required algorithms to be implemented are as follows: • Optimal • First In First Out (FIFO) • Least Recently Used (LRU) • Clock Compile the program using: make cat inputCLOCK.txt | ./lab4 | diff outputCLOCK.txt