In which of the storage placement strategies a program is placed in the smallest available hole in the main memory?

In which of the storage placement strategies a program is placed in the smallest available hole in the main memory? Correct Answer best fit

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.

Related Questions

A plate with an elliptical hole in the centre, with semi-major axis (a) perpendicular to the direction of loading and semi-minor axis (b) along the direction of loading, is subjected to a pull P. The maximum stress induced at the edge of the hole is equal to (where $$\sigma $$ = Stress for a plate with no hole i.e. nominal stress)
image of a black hole. Which black hole was the subject of this historic image?
If it takes 50 workers 4 hours to dig a hole, how long should it take 30 workers to dig the same hole?
If it takes 4 hours to dig a hole by 50 workers, how long should it take to dig the same hole by 30 workers?