In a system implementing pure demand paging and allocating three frames to each process…
In a system implementing pure demand paging and allocating three frames to each process second-chance replacement algorithms for the following page-reference string.
2, 6, 9, 2, 4, 2, 1, 7, 3, 0, 5, 2, 1, 2, 9, 5, 7, 3, 8, 5
second-change algorithms, in the diagram plotted above, to the left of each bar representing three pages in memory right after each page reference, use a ‘?’ to point to the head of the queue.
c) For 4) second-change algorithm, in the diagram plotted above, to the right of each bar representing three pages in memory right after each page reference, WRITE the value of the reference bit (0 or 1) of each page in memory.
d)INDICATE the number of page faults.
