How many pages are needed to store the entire job?

a. Use the best-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. b. Use the first-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. [2 + 2 = 4 marks] 2. If a program has 571 bytes and will be loaded into page frames of 100 bytes each, and the instruction to be used is at byte 132, 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. (Remember that page numbering starts at zero). [2 + 2 = 4 marks] 3. 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.

The post How many pages are needed to store the entire job? appeared first on My Assignment Online.