GATE CS 2023 Set 1 — Question 58
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+2 / -0MediumMultilevel & Inverted Page TablesMemory ManagementOperating System
Operating System → Memory Management → Multilevel & Inverted Page Tables
Last updated
Question
Consider a computer system with 57-bit virtual addressing using multi-level tree-structured page tables with L levels for virtual to physical address translation. The page size is 4 KB (1 KB = 1024 B) and a page table entry at any of the levels occupies 8 bytes.The value of L is __________.
Correct answer
5 to 5
Solution
Here is the step-by-step calculation to find the number of levels (L) in the page table structure:
The page offset is determined by the page size. It represents the address within a page.
Number of Page Offset bits = bits.
Number of VPN bits = Total VA bits - Page Offset bits
Number of VPN bits = bits.
These 45 bits are used to index the multi-level page tables.
Number of PTEs per page = entries.
Bits per level = bits.
L = .Therefore, the value of L is 5.
1.Given data:
- Virtual Address (VA) size = 57 bits
- Page Size (PS) = 4 KB = Bytes = Bytes = Bytes
- Page Table Entry (PTE) size = 8 Bytes = Bytes
The page offset is determined by the page size. It represents the address within a page.
Number of Page Offset bits = bits.
3.Calculate Virtual Page Number (VPN) bits:
The virtual address is split into the Virtual Page Number (VPN) and the Page Offset.Number of VPN bits = Total VA bits - Page Offset bits
Number of VPN bits = bits.
These 45 bits are used to index the multi-level page tables.
4.Calculate the number of entries per page table:
In a multi-level paging system, each page table must fit within a single physical page frame.Number of PTEs per page = entries.
5.Calculate the number of bits required per level:
Each level of the page table uses a part of the VPN to index into its table. The number of bits required to index 512 entries is:Bits per level = bits.
6.Calculate the number of levels (L):
The total 45 bits of the VPN are distributed among the L levels of the page table structure. Since each level requires 9 bits for indexing, we can find L by dividing the total VPN bits by the bits per level.L = .Therefore, the value of L is 5.
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Memory Management
2026 Set 2 Q23Which one of the following CPU scheduling algorithms cannot be preemptive?2026 Set 1 Q29With respect to deadlocks in an operating system, which of the following statements is/are FALSE?2026 Set 1 Q31In the context of relational database normalization, which of the following statements is/are true?2026 Set 1 Q35Consider a system consisting of instances of a resource , being shared by 5 processes.…2026 Set 2 Q51Consider three processes P1, P2, and P3 running identical code, as shown in the pseudocode below. A…