Question

You are designing a memory management
blocks of memory). You take a file size as input and return an appropriate memory hole.
One of the strategies used to assign holes is the best Fit Strategy' where the smallest hole which can
fit the file (hole >= file) is returned. Which DS of the following is the most appropriate to store all
current holes in?
Pick one of the choices
A. Array
B.Binary search tree
C.Hash table
D.Doubly linked list

Answer 1

Answer:

array

Explanation:

I studied in my school

Answer 2

Array is the answer.....