QuizzesContiguous Memory Allocation Strategies — Concept Check
intermediate
operating-systems

Contiguous Memory Allocation Strategies — Concept Check

Questions on Contiguous Memory Allocation Strategies. First Fit, Best Fit, and Worst Fit are strategies for allocating contiguous memory from a free list; each trades allocation speed for fragmentation outcomes, while the buddy system and slab allocator address specific use cases.

7 minutes 7 questions Pass at 70%
Time Limit
7 minutes - timer starts when you begin
Change Answers Freely
Revisit and change any answer before submitting
Full Review After Submit
Correct answers and explanations shown for every question
Auto-submit on timeout
Quiz submits automatically when time runs out

Questions in this quiz

7 questions on Contiguous Memory Allocation Strategies — Concept Check. Work through them here, then start the quiz to answer them and see your score.

  1. 1.A process requests 10MB of memory. The free list has blocks of 5MB, 12MB, and 20MB. Which block will First Fit choose?

    • A20MB block
    • B5MB block
    • C12MB block
    • DNone, as no block is exactly 10MB
  2. 2.A system using Best Fit for memory allocation is experiencing high fragmentation. What is the likely cause?

    • ABest Fit is too slow for large allocations
    • BBest Fit leaves small, unusable holes
    • CBest Fit always chooses the largest block
    • DBest Fit merges blocks inefficiently
  3. 3.A developer claims Worst Fit is ideal for future large allocations. What is a flaw in this reasoning?

    • AWorst Fit minimizes fragmentation
    • BWorst Fit often performs poorly in practice
    • CWorst Fit is the slowest allocation strategy
    • DWorst Fit is faster than First Fit
  4. 4.In a buddy system, what happens when a 16KB block is split for an 8KB request?

    • AIt cannot be split
    • BIt allocates the entire 16KB block
    • CIt splits into two 4KB blocks
    • DIt splits into two 8KB blocks
  5. 5.A Linux system uses a slab allocator for kernel objects. What is an advantage of this approach?

    • AMinimizes external fragmentation
    • BAlways allocates the smallest possible block
    • CUses power-of-2 block sizes
    • DO(1) allocation with zero internal fragmentation
  6. 6.A process requests memory, and the allocator uses Worst Fit. The free list has 10MB, 15MB, and 25MB blocks. Which block is chosen?

    • ANone, as no block is exactly requested size
    • B15MB block
    • C25MB block
    • D10MB block
  7. 7.Why might First Fit leave large holes at the end of memory?

    • AIt requires scanning the entire free list
    • BIt stops searching after finding the first fit
    • CIt merges blocks inefficiently
    • DIt always chooses the largest block