Given memory holes (i e, unused memory blocks of 100K, 500K, 200K, 300K and 600K

Question

Given memory holes (i e, unused memory blocks of 100K, 500K, 200K, 300K and 600K (in address order) as shown below, how would each of the first-fit, best-fit and worst-fit algorithms allocate memory requests for 310K, 80K, 350K and 230K (in this order? The shaded areas are used/allocated regions and are not available. Write your answer into the following diagrams. You should clearly write down the size of each memory block and indicate its status (i.e., allocated or free). First-Fit Best-Fit Worst-Fit:

Explanation / Answer

First Fit --->

Best Fit ----->

Worst Fit ----->

350k request is not granted.

unused memory blocks 100k 500k 200k 300k 600k memory request 80k 310k free 230k 350k

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.