Which page table structure reduces memory overhead by maintaining ONE entry for each physical frame in memory rather than each logical page?
Option C is correct. An Inverted Page Table has one entry per physical frame (storing process ID and virtual page number), drastically saving memory for large virtual address spaces.
Which dynamic memory allocation strategy allocates the LARGEST available free hole, creating the largest leftover hole?
Option A is correct. Worst Fit searches the entire memory list for the largest free partition, leaving behind a remaining block that may be large enough for future processes.
What is Shared Memory in a paging system?
Option A is correct. Shared memory is achieved by having the page table entries of different processes point to the same physical memory frames (e.g., shared C libraries).
Which bit in a Page Table Entry is set to 1 whenever a page is modified by a write operation, indicating it must be written back to disk before being replaced?
Option C is correct. The Dirty (or Modified) bit tracks whether a page has been written to. If set, the page must be written back to swap space when evicted.
Why is multi-level (hierarchical) paging used in modern 64-bit operating systems?
Option A is correct. Multi-level paging breaks huge contiguous page tables into smaller paged units, allowing unallocated sections of the page table to not occupy RAM.