Loading previous year questions
Operating Systems · Memory Management and Virtual Memory
Official IIT answer key · IIT Kharagpur · Audited Aug 2026
GATE CSE 2014 Set 1 Q33 · NAT · 2 marks
Key concept
No account needed
Sit 5 related Memory Management and Virtual MemoryPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
Memory management and virtual memory is a high-yield, computation-heavy topic in GATE CS, frequently carrying 2-mark NAT and MCQ/MSQ questions. The exam heavily emphasizes multi-level page table sizing, hierarchical bit-splitting, page replacement algorithm simulation (FIFO, LRU, OPTIMAL, MRU, LIFO), and Effective Memory Access Time (EMAT) calculations involving TLBs and disk transfers. Recent years have introduced variants such as bounded lookahead optimal replacement, code-based loop/array access patterns, and TLB reach sizing.
Full Memory Management and Virtual Memory guide →Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using the *optimal replacement policy* is …
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.