What is buddy memory management of free lists ? – McqOptions

MCQOPTIONS

1.	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
Answer» C. modified version of best fit

Discussion

No Comment Found

Related MCQs

Accessing free list very frequently for wide range of addresses can lead to
How are free blocks linked together mostly and in what addressing order?
Assume there is a free list which contains nodes and is filled with a value if it is already assigned and the value will be the size of requested block else will be 0. The above code represents what?
What are the disadvantages in implementing buddy system algorithm for free lists?
HOW_ARE_FREE_BLOCKS_LINKED_TOGETHER_MOSTLY_AND_IN_WHAT_ADDRESSING_ORDER??$
What are the disadvantages in implementing buddy system algorithm for free lists ?
How does implicit free lists(garbage collection) works in adding memory to free list ?
What is buddy memory management of free lists ?
What are different ways of implementing free lists and which is simple among them?
What datastructures can be used in implementing a free list?