Question

What is buddy memory management of free lists ?

(a) modified version of first fit

(b) buddy allocation keeps several‭ ‬free lists,‭ ‬each one holds blocks which are of one particular size

(c) modified version of best fit

(d) a tree representation of free lists

I'd like to ask this question from Free List topic in portion Types of Lists of Data Structures & Algorithms I

The question was asked during an interview for a job.

Answer 1

Correct answer is (b) buddy allocation keeps several‭ ‬free lists,‭ ‬each one holds blocks which are of one particular size

The best explanation: When an allocation request is received,‭ ‬the list that holds blocks that are just large enough to satisfy the request are considered, and an open location is returned.‭ ‬If no‭ ‬free‭ ‬blocks that are smaller than two times the size that are requested are available,‭ ‬a larger block is split in two to satisfy the requirements.