Correct Answer: C. A small fast cache of recently used page-table entries
Explanation:
A TLB stores recent virtual-page to physical-frame translations close to the processor.
It reduces the need to access the page table in main memory for every reference.
The page number selects a page-table entry, and the offset selects a byte within that page.
The physical address combines the resulting frame number with the unchanged offset.
Correct Answer: A. The page number and offset can be separated using simple binary bit fields
Explanation:
A power-of-two page size lets hardware divide an address by selecting high and low bit ranges.
No arithmetic division is needed to identify the page number and offset.
Paging can place pages in any free frames, so one large contiguous physical hole is unnecessary.
Some internal fragmentation may still occur in the final page of a process.
Correct Answer: D. It repeatedly splits power-of-two blocks and merges free buddy pairs
Explanation:
The buddy system organizes blocks by powers of two for fast splitting and coalescing.
Two free buddies of the same size can merge into their parent block.
Correct Answer: C. To map a process's virtual page numbers to physical frame numbers
Explanation:
A page table provides the translation information required for paged address spaces.
Each process normally has its own mapping because its virtual address space is independent.
Correct Answer: C. The operating system occupies one region and one user process occupies the remaining region
Explanation:
Single-partition allocation supports only one resident user process in the available user-memory region.
It is simple but provides poor multiprogramming and memory utilization.
Correct Answer: D. Memory is divided in advance into a fixed number of partitions
Explanation:
Fixed partitions have predetermined boundaries and sizes established before process placement.
A process must fit in one available partition, which can cause internal fragmentation.