Consider a 32-bit system with 4 KB page size and page table entries of size 4 bytes each. Assume bytes. The OS uses a 2-level page table for memory management, with the page table containing an outer page directory and an inner page table. The OS allocates a page for the outer page directory upon process creation. The OS uses demand paging when allocating memory for the inner page table, i.e., a page of the inner page table is allocated only if it contains at least one valid page table entry. An active process in this system accesses 2000 unique pages during its execution, and none of the pages are swapped out to disk. After it completes the page accesses, let denote the minimum and denote the maximum number of pages across the two levels of the page table of the process.
The value of is ________.
GATE CS 2024 (Afternoon) — Question 64
Operating Systems (OS)Memory Management and Virtual MemoryNAT2 marksHard
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on Memory Management and Virtual Memory
- GATE CS 2026 (Afternoon) · Q54A system has a Translation Lookaside Buffer (TLB) that has a reach of 1 MB. TLB reach is defined as the total amount of physical memory tha…
- GATE CS 2026 (Afternoon) · Q55Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory…
- GATE CS 2025 (Forenoon) · Q14Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assumi…
- GATE CS 2025 (Forenoon) · Q54In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modificati…
- GATE CS 2025 (Afternoon) · Q47Consider a demand paging system with three frames, and the following page reference string: 1 2 3 4 5 4 1 6 4 5 1 3 2. The contents of the…
- GATE CS 2025 (Afternoon) · Q58A computer system supports a logical address space of 2 32 bytes. It uses two-level hierarchical paging with a page size of 4096 bytes. A l…

