Q518
In which of the storage placement strategies a program is placed in the smallest available hole in the main memory?
A.
best fit
AnswerB.
first fit
C.
worst fit
D.
buddy
E.
None of the above
Answer: Option A
Solution
Answer: Option A
Solution:
The best fit deals with allocating the smallest free partition which meets the requirement of the requesting process. This algorithm first searches the entire list of free partitions and considers the smallest hole that is adequate. It then tries to find a hole which is close to actual process size needed.