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

Holigioug

Jump to level $1$

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

$\backslash$table$[[$Hole$,$A$,$B$,$C$,$D$,$E$,$F$],[$Size$,130,100,30,20,120,60]]$

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

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

Block with size $10$ : $$

Block with size $50$ : $$

Block with size $40$ : $$

Enter the number of holes that best$-$fit had to exarnine to allocate the $3$ blocks if the holes are as given in the table $($not sorted by size$).$

$18$

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$).$

$18$

$$

Nex