Question

Page replacement is an important activity to optimize the memory usage. An Optimal Page Replacement algorithm
1) always has lowest page fault rate among all algorithms
2) will never suffer from Belady’s anomaly
3) difficult to implement as it needs future knowledge of the reference string
4) All of the above

Answer 1

1) always has lowest page fault rate among all algorithms