The ____ keeps the free/busy lists organized by memory locations, low-order memory to high-order memory.
A) fixed partition allocation
B) first-fit memory allocation
C) dynamic fit memory allocation
D) best-fit memory allocation

Question

Quizplus · Accepted Answer

The first-fit memory allocation algorithm searches for the first available block of memory that is large enough to accommodate the requested size, starting from the beginning of the memory space. As it searches from low-order memory to high-order memory, it is required to keep the free/busy lists organized by memory locations. Therefore, option B is the correct answer.

The ____ Keeps the Free/busy Lists Organized by Memory Locations