Question

Consider the following page reference string.

1 2 3 4 5 3 4 1 6 7 8 7 8 9 5 4 5 4 2 1 3 5

How many page faults would occur in case of
i) LRU
ii) FIFO
iii) Optimal page replacement algorithms
Assuming 3 frames. Check for Belady’s anomaly considering 4 frames.