Due Date: Saturday, April 3 at 11:59 pm
Submit: Canvas
Late Policy: -10 points per hour late
Instructions: This is an individual assignment. Answers should be your own work, in your own words. Most answers should be more than a few sentences and up to half a page in length. An answer that is too brief or simple will not get full credit.
6 problems, 16 points each
Chapter 7
1) Discuss two problems in fixed partitioning.
2) Explain how relative addressing supports relocation.
3) Given a 32 Megabyte memory space and the following requests, illustrate the final memory configuration after the following requests are made using the Buddy System. Use a rule of first allocating the left block of a split pair.
P1: Requests 2M
P2: Requests 4M
P3: Requests 8M
P4: Requests 4M
P1: Releases 2M
Chapter 8
4) In a paging scheme, how is a virtual address translated into a physical address?
5) Explain What happens when a page fault occurs.
6) From the starting point below, what is the result after the following page
requests are made using the Clock policy: 3, 2, 1, 5
—–
| >5 |
| 4* |
| 2 |
—–
0 comments