In the Dynamic Partitioning Technique of Memory Management, the Placement

Multiple Choice

In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and chooses the next available block that is large enough to satisfy the request is called __________ .

A) last-fit
B) best-fit
C) next-fit
D) first-fit