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)

For the 1603 bytes by the best –fit policy is 2200 because we choose the smallest block which will hold the appeal the apply for for 1603 will be honored by block 2200

b)

For 949 bytes by the best –fit policy is 1000 because the smallest block available that will hold the request for 949 bytes is 1000

c)

For 349 bytes by the worst-fit policy is 2200 because the we choose small block available out of unallocated blocks so. The request for 349 will be honored by block 2200 only

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

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