A memory manager for a variable-sized region strategy has a free list of blocks

Question

A memory manager for a variable-sized region strategy has a free list of blocks of size 600, 400, 1000, 2200, 1600, and 1050 bytes.

a) What block will be selected to honor a request for 1603 bytes using the best-fit policy?

b) What block will be selected to honor a request for 949 bytes using the best-fit policy?

c) What block will be selected to honor a request for 349 bytes using the worst-fit policy?

d) Assume the free list is ordered as the blocks are listed in the problem statement. What block will be selected to honor a request for 1603 bytes using the first-fit policy?

e) Assume the free list is ordered as the blocks are listed in the problem statement. What block will be selected to honor a request for 11049 bytes using the first-fit policy?

Explanation / Answer

a) What block will be selected to honor a request for 1603 bytes using the best-fit policy?

2200

b) What block will be selected to honor a request for 949 bytes using the best-fit policy?

1000

c) What block will be selected to honor a request for 349 bytes using the worst-fit policy?

d) Assume the free list is ordered as the blocks are listed in the problem statement. What block will be selected to honor a request for 1603 bytes using the first-fit policy?

e) Assume the free list is ordered as the blocks are listed in the problem statement. What block will be selected to honor a request for 1049 bytes using the first-fit policy?

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

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