$8\mathrm{.}19\mathrm{.}1$: Requirements for efficient memory management.

Jump to level $1$

Memory contains $6$ holes with their sizes shown in the table.

A sequence of requests for $3$ blocks have arrived with sizes $50,80,$ and $60.$

Select the hole allocated to each request by the best$-$fit allocation strategy.

Block with size $50$:

Block with size $80$:

Block with size $60$:

Enter the number of holes that best$-$fit had to examine to allocate the $3$ blocks if the holes are as given in the table

$($not sorted by size$).$

Ex: $2$hat$(v)$

Enter the number of holes that best$-$fit would have to examine to allocate the $3$ blocks if the holes were always

maintained in sorted order $($ascending by hole size$).$