4. Assume a program has 510 bytes and will be loaded into page frames of 256 bytes each, and the instruction to be used is at byte 377, answer the following questions:
a. How many pages are needed to store the entire job?
b. Compute the page number and exact displacement for each of the byte addresses where the data is stored.
5. Given that main memory is composed of only three page frames for public use and that a seven-page program (with pages a, b, c, d, e, f, g) that requests pages in the following order:
a, c, a, b, a, d, a, c, b, d, e, f
a. 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.
b. 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.
c. What general statement can you make from this example? Explain your answer.
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
a. 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.
b. 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.
c. What general statement can you make from this example? Explain your answer