In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modification of the optimal page replacement algorithm is as follows:
The OS correctly predicts only up to next 4 page references (including the current page) at the time of allocating a frame to a page.
A process accesses the pages in the following order of page numbers:
1, 3, 2, 4, 2, 3, 1, 2, 4, 3, 1, 4
If the system has three memory frames that are initially empty, the number of page faults that will occur during execution of the process is ________. (Answer in integer)
GATE CS 2025 (Forenoon) — Question 54
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 (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…
- GATE CS 2024 (Forenoon) · Q62Consider a memory management system that uses a page size of 2 KB. Assume that both the physical and virtual addresses start from 0. Assume…

