Figure 2 shows a circular list for clock page replacement algorithm. The reference bit for page A,B,C,D,E,F...

Fig. 2 2. Fig. 2 shows a circular list for clock page replacement algorithm. The reference bit for page A, B. C, D, E, F G. H, I. J. K, L is 1, 1,1.1,0,0,0,0, 1.1. 1, I, correspondingly. Which page will be replaced when page fault occurs? Answer A computer has four page frames and eight pages. Assume Least Recently Used (LRU) page replacement algorithm is used. How many page fault will occur with the reference string 0 7 0540412 3. Page fault: After above processing is finished, the linked list becomes: 0 1 2 3 Fig. 3 shows a matrix of nxn bits which is used to Least Recently Used (LRU) Page Replacement Algorithm. There are four pages. The Pages referenced in order: 3 120 Show the status of this matrix after pages 3 and I are referenced 4. 2 000 Fig.3