Using one use bit with each page entry, list the pages recorded in the following sequence and hence determine the pages removed using the one use bit approximation to the least recently used algorithm:
give that there are four pages in the memory partition. The use bits are only read at page fault time.
Suppose two use bits are provided. The first use bit is set when the page is first referenced. The second use bit is set when the page is referenced. Deduce an algorithm to pages from the partition, and list the pages.