Fig. 2 2. Fig. 2 shows a circular list for clock page replacement algorithm. The

ID: 3739346 • Letter: F

Question

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

Explanation / Answer

2 ANSWER

GIVEN BY

The clock is originally pointing to C.

as a page fault occurs , the next would happen:

Since C has a position bit 1, the position bit of C would be made 0 and the clock indicator would move ahead to D.

Since the mention bit od D is 1, it will be made 0 furthermore the clock pointer would proceed to E.

Since the position bit fo E is 0, it will we replace by the new page and the orientation bit would be complete 1

Finally the clock stick would tip to F.

Navigate

Fig. 19.13. Diagram showing an infinitesimal length dx at an arbitray distance a

Fig. 2 Pooled weighted mean differences in weight reduction between vegetarian a

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

Fig. 2 2. Fig. 2 shows a circular list for clock page replacement algorithm. The

Question

Explanation / Answer

Related Questions

Navigate