Best - fit yields smallest free block size greater than or equal to requested size - Data Structure

Q.  Which strategy of memory allocation yields the smallest free block size greater than or equal to the requested size?
- Published on 27 Aug 15

a. First - fit
b. Best - fit
c. Worst - fit
d. Next - fit

ANSWER: Best - fit

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 18 Nov 15
    Best-fit strategy of memory allocation yields the smallest free block size greater than or equal to the requested size.
    Best-fit memory allocation makes the best use of available memory but this algorithm slower in making allocation because it searches the whole available memory. It suffers from external fragmentation.
    Algorithm:
    - Search the whole available space on each allocation
    - Choose the smallest block that can satisfy request
    - If match found, stop the search.
    Disadvantage: This strategy produces the smallest leftover hole

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲