There is an answer key at the top. The statement LFU 1172351 achieves LFU Their second string sequence of 123452, which should result in LRU 123452 to get LRU

4. Discuss situations in which the least frequently used (LFU) page-replacement algorithm generates fewer page faults than the least recently used (LRU) page-replacement algorithm. Also discuss under what circumstances the opposite holds. Answer Consider the following sequence of memory accesses in a system that can hold four pages in accessed, the least frequently used page-replacement algorithm would replace a page other than 1, and therefore would not incur a page fault when 3452" the least recently used algorithm performs better. memory: 1123 451. When page 5 is page 1 l is accessed again. On the other hand, for the sequence "12 Strin reference723 LRu Repalement LFU Replace ent 17 2 35 1 72 35 5 2 Page faults Page fouts = 5 Freauencies 1-2 7-0 21-1 51 String veterence: 12945 2 LRu LFu Repacement I 234 52 2. e fault 5 uencies 1-0, 2-2 3 4