1. The document discusses block replacement algorithms like FIFO and optimal and compares their performance on sample reference strings.
2. It shows an example calculation of hits and misses using FIFO replacement on a reference string with 3 blocks. FIFO had 5 hits and 15 misses, for a hit ratio of 25%.
3. The document introduces Belady's Anomaly, where increasing the number of blocks can paradoxically increase misses for some algorithms like FIFO. It provides an example reference string where FIFO has more misses with 4 blocks than with 3 blocks.