Question
Which one of the following statements is FALSE?
Official answer and solution
- Official answer
- C
- From
- Official GATE 2022 answer key
Solution
Analyze the operational properties of Translation Lookaside Buffers, inverted page tables, and hashed page tables.
Evaluating each statement:
- (A) TRUE: The TLB is implemented using associative (content-addressable) memory where all valid entries are compared in parallel against the virtual page number.
- (B) TRUE: A TLB hit means the page table has mapped the virtual page to a valid physical frame residing in main memory. If a subsequent cache search misses, the CPU fetches the word from that main memory frame.
- (C) FALSE: An inverted page table is typically searched using a hash anchor table with collision chains. Virtual addresses whose page numbers hash to buckets with collisions must traverse linked lists of varying lengths, so memory access times vary across virtual addresses.
- (D) TRUE: In hashed page tables, collisions require traversing a chain of entries, which causes addresses with collisions to have longer search times than those without collisions.
Final answer
Option (C)
Common trap
Thinking an inverted page table provides constant-time access for all addresses without considering hash collisions.
The answer is the one in the official GATE answer key. The solution is this site's own explanation.
Source
- Paper
- GATE 2022 Computer Science and Information Technology (CS)
- Question
- 38 of 65
- Section
- Computer Science and Information Technology
Report an error in this question
GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.