Page $1$:

$1$

Page $2$:

$2$

Page $3$:

$3$

Page $4$:

$4$

Page $5$:

$5$

Page $6$:

$6$

Page $7$:

Page $2$ of $50$

Question $2(0\mathrm{.}3$ points$)$

In the Dynamic Partitioning technique of memory management, the placement algorithm that chooses the block that is closest in size to the request is called $().$

$$ next$-$fit

last$-$fit

first$-$fit

best$-$fit

Page $2$ of $50$

$1$ of $50$ questions saved