Same algorithms and numbers as the 3D memory-board version.
The science
Virtual memory maps pages onto F physical frames. A reference to a non-resident page is a page fault; with all frames full the policy must pick a victim.
FIFO evicts the oldest-loaded page. LRU evicts the page with the oldest last use. Clock keeps a reference bit and a circular hand: a set bit is cleared (second chance), the first clear bit is evicted. Optimal (Belady's MIN) evicts the page whose next use is farthest away: victim = argmax(next_use(p)); it needs the future, so it is only a benchmark.
Belady's anomaly: for FIFO, more frames can mean more faults. The string 1 2 3 4 1 2 5 1 2 3 4 5 gives 9 faults with 3 frames but 10 with 4. LRU and Optimal are stack algorithms (the set held with F frames is a subset of the set held with F+1), so they can never show it.
Simplifications: a single process, fixed frame allocation, no dirty-bit write-back, no prefetching, and the fault ratio replaces real time (a fault costs roughly 104 to 106 times a hit). Random strings use a fixed seed so results repeat.