A system uses demand paging with 4 frames of memory. All frames are initially empty, so your first unique pages will cos

[answerhappygod]

A system uses demand paging with 4 frames of memory. All frames
are initially empty, so your first unique pages will cost one fault
each. Consider the following page reference string, 2, 1, 4,
0, 4, 0, 5, 1, 3, 4, 4, 5
Answer the following questions.
(a) If the system uses the LRU page replacement algorithm,
how many page faults would occur and what will be the final
configuration of the 4 frames following the execution of the given
reference string?
(b) If the system uses the FIFO page replacement
algorithm, how many page faults would occur and what will be the
final configuration of the 4 frames following the execution of the
given reference string?
(c) Assume these page references are from a single
process. Show the page table (i.e., memory map) immediately after
the 4th page reference in the page reference string (note that we
count from 1, so in this case, that is after the 1st reference to
page 0 and before the 2nd reference to page 4).
(d) Contrast memory access latency for a memory access
that results in a page fault and that results in no page fault.