Given that main memory is composed of only three-page frames for public use and that a program requests pages in the following order:
a, c, b, d, a, c, e, a, c, b, d, e
Using the FIFO page removal algorithm, indicate the movement of the pages into and out of the available page frames (called a page trace analysis) indicating each page fault with an asterisk (*). Then compute the failure and success ratios.
Increase the size of memory so it contains four-page frames for public use. Using the same page requests as above and FIFO, do another page trace analysis and compute the failure and success ratios.
What general statement can you make from this example? Explain your answer.
