Consider a demand paging system with four page frames (initially empty) and LRU page replacement policy. For the following page reference string
7, 2, 7, 3, 2, 5, 3, 4, 6, 7, 7, 1, 5, 6, 1
the page fault rate, defined as the ratio of number of page faults to the number of memory accesses (rounded off to one decimal place) is _________.
GATE CS 2022 (Forenoon) — Question 64
Operating Systems (OS)Memory Management and Virtual MemoryNAT2 marksMedium
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…

