Belady's Anomaly: FIFO vs LRU vs Optimal, Checked in Python

Page replacement questions in GATE CS are mostly counting. You get a reference string, a number of frames and a policy, and you write a row of letters. The idea is easy; the marks go when you lose tra