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 105 bytes.

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

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

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

d.)What block will be selected to honor a request for 349 bytes using worst fit policy?

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

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

Explanation / Answer

a.) What block will be selected to honor a request for 1603 bytes using best-fit policy? ANS:2200

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

c.)What block will be selected to honor a request for 1603 bytes using worst-fit policy?ANS:2200

d.)What block will be selected to honor a request for 349 bytes using worst fit policy?ANS:2200

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

f.)Assume the free list is ordered as the blocks are listen in the problem statement. What block will be selected to honor a request for 1049 bytes using first fit policy?ANS:2200

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

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