Answer the following questions true (T) or false (F)

1. What is the difference between second change page replacement algorithm and a simple FIFO algorithm?

2. Answer True/False with justification: L1 caches usually have higher associativity compared to L2 caches.

1. True FIFO requires us to maintain a queue containing all frames. Second Chance only requires a bit per frame. FIFO has been shown to sometimes perform worse than random replacement. An LRU policy would be better but difficult to implement cost effectively. Second Chance is a simplified variant of LRU which should be expected to outperform FIFO and at its worst case be equivalent to FIFO
2. False.  L1 caches must primarily be fast, and therefore cannot usually afford high associativity.  This works out well because L1 caches usually have hits on addresses that are spatially local to the program.  Strange addresses accessed unexpectedly might more easily trigger a cache miss, which an L2 cache could supply by having a high associativity and being capable of storing 'rare' addresses without the need of evicting often.