Each entry in a segment table has a ____________

A. Segment base
B. Segment peak
C. Segment value
D. None of the mentioned

In paging the user provides only ________ which is partitioned by the hardware into ________ and ______

A. One address, page number, offset
B. One offset, page number, address
C. Page number, offset, address
D. None of the mentioned

In segmentation, each address is specified by ____________

A. A segment number & offset
B. An offset & value
C. A value & segment number
D. A key & value

When the memory allocated to a process is slightly larger than the process, then ____________

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

Sometimes the overhead of keeping track of a hole might be ____________

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

External fragmentation will not occur when?

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

External fragmentation exists when?

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

__________ is generally faster than _________ and _________

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

The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is ____________

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

If relocation is static and is done at assembly or load time, compaction _________

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