Q. Consider the subsequent page reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would take place for the following replacement algorithms assuming one, two, three, four, five, six, or else seven frames? Remember all frames are primarily empty therefore your first unique pages will all cost one fault each.
- LRU replacement
- FIFO replacement
- Optimal replacement
