- G Total 6 Marks Consider The Following Page Reference String 3 0 9 0 1 2 8 1 7 8 2 3 8 1 8 7 8 7 8 2 I 3 Marks 1 (36.47 KiB) Viewed 23 times
g) (Total: 6 marks). Consider the following page reference string: 3,0,9,0,1,2,8,1,7,8,2,3,8,1,8,7,8,7,8,2 (i) (3 marks). How many page faults would occur for the least recently used (LRU) replacement algorithms, assuming four frames? As part of your answer, show the final content of the frames. (ii) (3 marks). Is the number of page faults in part (i) optimal? Justify your answer. As part of your answer, show the final content of the frames. Note: all frames are initially empty; thus, each first unique page costs one fault.