A. Is being used
B. Is not being used
C. Is always used
D. None of the mentioned

A. Compaction
B. Larger memory space
C. Smaller memory space
D. None of the mentioned

A. Permit the logical address space of a process to be noncontiguous
B. Permit smaller processes to be allocated memory at last
C. Permit larger processes to be allocated memory at last
D. All of the mentioned

A. Cannot be done
B. Must be done
C. Must not be done
D. Can be done

A. The cost incurred
B. The memory used
C. The cpu used
D. All of the mentioned

A. First fit, best fit, worst fit
B. Best fit, first fit, worst fit
C. Worst fit, best fit, first fit
D. None of the mentioned

A. Enough total memory exists to satisfy a request but it is not contiguous
B. The total memory is insufficient to satisfy a request
C. A request cannot be satisfied even when the total memory is free
D. None of the mentioned

A. First fit is used
B. Best fit is used
C. Worst fit is used
D. No matter which algorithm is used, it will always occur

A. Larger than the memory
B. Larger than the hole itself
C. Very small
D. All of the mentioned

A. Internal fragmentation occurs
B. External fragmentation occurs
C. Both internal and external fragmentation occurs
D. Neither internal nor external fragmentation occurs