The GATE Grind

GATE Operating System: Memory Management and Virtual Memory – Previous Year Questions

42 GATE previous year questions on Memory Management and Virtual Memory (Operating System, Computer Science) with answers and explanations, from every paper.

42 questions worth 72 marks in all (12 1-mark, 30 2-mark). Asked between 2007 and 2026, so you can see how the topic has been tested over time.

  1. GATE 2007 CS Q56 (2 marks, Multiple choice) – Fixed-frame virtual memory uses FIFO replacement. P: increasing frames sometimes increases fault rate. Q: some programs do not exhibit locality. Which…
  2. GATE 2007 CS Q82 (2 marks, Multiple choice) – A process has3 page frames, initially empty, and reference string1, 2, 1, 3, 7, 4, 5, 6, 3, 1. How many page faults occur under optimal replacement?
  3. GATE 2007 CS Q83 (2 marks, Multiple choice) – A process has3 page frames, initially empty, and reference string1, 2, 1, 3, 7, 4, 5, 6, 3, 1. How many more page faults occur under LRU than under…
  4. GATE 2008 CS Q67 (2 marks, Multiple choice) – A processor has36-bit physical and32-bit virtual addresses, 4 KB page frames, and4-byte page-table entries. Three levels index virtual bits30–31,…
  5. GATE 2009 CS Q9 (1 mark, Multiple choice) – In which one of the following page replacement policies may Belady’s anomaly occur?
  6. GATE 2009 CS Q10 (1 mark, Multiple choice) – The essential content(s) in each entry of a page table is/are
  7. GATE 2009 CS Q34 (2 marks, Multiple choice) – Why is a multilevel page table preferred over a single-level page table for virtual-to-physical translation?
  8. GATE 2021 CS (CS2) Q58 (2 marks, Numerical answer) – A three-level page table translates 39-bit virtual addresses with fields: level-1 index 9 bits, level-2 index 9, level-3 index 9, page offset 12.…
  9. GATE 2015 CS (CS2) Q41 (2 marks, Multiple choice) – Six fixed memory partitions have sizes 200,400,600,500,300,250 KB. Processes of 357,210,468,491 KB arrive in that order. Under best fit, which…
  10. GATE 2015 CS (CS2) Q43 (2 marks, Numerical answer) – A system has 8 KB pages and 32-bit physical addresses. Every page-table entry contains valid, dirty, three permission bits, and a translation. Maximum…
  11. GATE 2010 CS Q34 (1 mark, Multiple choice) – FIFO page replacement has four initially empty frames. Access one hundred distinct pages in order, then the same pages in reverse. How many faults…
  12. GATE 2011 CS Q30 (1 mark, Multiple choice) – Page-fault service time is 10 ms; normal memory access is 20 ns. One fault occurs per 10⁶ accesses. Find effective access time.
  13. GATE 2013 CS Q62 (2 marks, Multiple choice) – Virtual addresses are 46 bits, physical addresses 32 bits. A three-level page table has one-page T₁, entries of T₁ pointing to T₂ pages and T₂ entries…
  14. GATE 2012 CS Q52 (2 marks, Multiple choice) – With three initially empty frames, reference string is 1,2,3,2,4,1,3,2,4,1. Let LRU,FIFO,OPTIMAL be fault counts. Which relation holds?
  15. GATE 2016 CS (CS2) Q30 (1 mark, Multiple choice) – Which page replacement algorithm can have an increased fault rate when more frames are allocated?
  16. GATE 2014 CS (CS3) Q30 (1 mark, Numerical answer) – A system uses three initially empty page frames and LRU replacement. Find total page faults for reference string 4,7,6,1,7,6,1,2,7,2.
  17. GATE 2014 CS (CS3) Q43 (2 marks, Numerical answer) – A paging system has its entire page table and all pages in physical memory. TLB search takes 10 milliseconds and physical-memory access takes 80…
  18. GATE 2014 CS (CS2) Q43 (2 marks, Multiple choice) – Twenty page frames initially contain pages 101–120. A program accesses 1,2,…,100 in order, repeating this sequence thrice. Which replacement policy…
  19. GATE 2014 CS (CS1) Q43 (2 marks, Numerical answer) – Three page frames are initially empty. For reference string 1,2,3,4,2,1,5,3,2,4,6, find page faults using optimal replacement.
  20. GATE 2017 CS (CS1) Q50 (2 marks, Multiple choice) – Recall that Belady's anomaly is that the page-fault rate may *increase* as the number of allocated frames increases. Now, consider the following…
  21. GATE 2016 CS (CS1) Q57 (2 marks, Numerical answer) – Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per…
  22. GATE 2016 CS (CS1) Q59 (2 marks, Numerical answer) – Consider a computer system with ten physical page frames. The system is provided with an access sequence (a 1, a 2, , a 20, a 1, a 2, , a 20), where…
  23. GATE 2015 CS (CS1) Q29 (1 mark, Numerical answer) – Consider a system with byte-addressable memory, 32-bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the…
  24. GATE 2015 CS (CS1) Q57 (2 marks, Multiple choice) – Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of…
  25. GATE 2018 CS Q20 (1 mark, Multiple choice) – Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is M units if the…
  26. GATE 2026 CS (CS2) Q54 (2 marks, Numerical answer) – A system has a Translation Lookaside Buffer (TLB) with reach 1 MB. The paging system uses pages of size 4 KB. The virtual address space is 64 GB and…
  27. GATE 2026 CS (CS2) Q55 (2 marks, Numerical answer) – Consider contiguous allocation of physical memory to processes using variable partitioning. There are 8 holes of sizes 20 KB, 4 KB, 25 KB, 18 KB, 7…
  28. GATE 2026 CS (CS1) Q54 (2 marks, Multiple choice) – Consider a system that has a cache memory unit and a memory management unit (MMU) with a Translation Lookaside Buffer (TLB). Which one of the…
  29. GATE 2025 CS (CS2) Q47 (2 marks, Multiple select) – Consider 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 frames are…
  30. GATE 2025 CS (CS2) Q58 (2 marks, Numerical answer) – A computer system supports a logical address space of 232 bytes. It uses two-level hierarchical paging with a page size of 4096 bytes. A logical…
  31. GATE 2025 CS (CS1) Q14 (1 mark, Multiple choice) – Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the…
  32. GATE 2025 CS (CS1) Q54 (2 marks, Numerical answer) – In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modification of the…
  33. GATE 2024 CS (CS2) Q24 (1 mark, Multiple select) – Which of the following tasks is/are the responsibility/responsibilities of the memory management unit (MMU) in a system with paging-based memory…
  34. GATE 2024 CS (CS2) Q64 (2 marks, Numerical answer) – Consider a 32-bit system with 4 KB page size and page table entries of size 4 bytes each (1 KB = 210 bytes). The OS uses a 2-level page table with an…
  35. GATE 2024 CS (CS1) Q62 (2 marks, Numerical answer) – Consider a memory management system that uses a page size of 2 KB. Assume that both the physical and virtual addresses start from 0. Pages 0, 1, 2,…
  36. GATE 2023 CS Q57 (2 marks, Numerical answer) – Consider the following two-dimensional array D in the C programming language, which is stored in row-major order: int D[128][128]; Demand paging is…
  37. GATE 2023 CS Q58 (2 marks, Numerical answer) – Consider a computer system with 57-bit virtual addressing using multi-level tree-structured page tables with L levels for virtual to physical address…
  38. GATE 2022 CS Q38 (2 marks, Multiple choice) – Which one of the following statements is FALSE?
  39. GATE 2022 CS Q64 (2 marks, Numerical answer) – Consider a demand paging system with four page frames (initially empty) and LRU page replacement policy. For the following page reference string 7, 2,…
  40. GATE 2021 CS (CS1) Q21 (1 mark, Multiple select) – In the context of operating systems, which of the following statements is/are correct with respect to paging?
  41. GATE 2020 CS Q21 (1 mark, Multiple choice) – Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit the process's memory…
  42. GATE 2020 CS Q63 (2 marks, Numerical answer) – Consider a paging system that uses 1-level page table residing in main memory and a TLB for address translation. Each main memory access takes 100 ns…