GATE CS 2026 Set 2 — Question 54
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+2 / -0HardPaging & Address TranslationMemory ManagementOperating SystemTLB & EAT
Operating System → Memory Management → Paging & Address Translation
Last updated
Question
A 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 that can be accessed through the TLB entries. The paging system uses pages of size 4 KB. The virtual address space is 64 GB and physical address space is 1 GB. If each TLB entry stores a 4-bit process id, page number, frame number, and a 2-bit control field, then the size of the TLB (in bytes) is ___________. (answer in integer)Note:
Correct answer
1536 to 1536
Solution
Given:
TLB Reach is the product of the number of entries and the page size.Step 2: Determine the size of fields in a TLB entry.
- TLB Reach = 1 MB = bytes
- Page Size = 4 KB = bytes
- Virtual Address Space (VAS) = 64 GB = bytes
- Physical Address Space (PAS) = 1 GB = bytes
TLB Reach is the product of the number of entries and the page size.Step 2: Determine the size of fields in a TLB entry.
- Page Number (VPN): Derived from Virtual Address bits minus Page Offset bits.
- Virtual Address bits = bits
- Page Offset bits = bits
- VPN bits = bits
- Frame Number (PFN): Derived from Physical Address bits minus Page Offset bits.
- Physical Address bits = bits
- PFN bits = bits
- Other fields given:
- Process ID = 4 bits
- Control Field = 2 bits
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…