Computer Science · Memory Management
Which one of the following statements is FALSE regarding virtual memory and page tables?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The TLB performs an associative search in parallel on all its valid entries using the page number of the incoming virtual address.
- 2If the virtual address of a word given by the CPU has a TLB hit, but the subsequent search for the word results in a cache miss, then the word will always be present in the main memory.
- 3The memory access time using a given inverted page table is always the same for all incoming virtual addresses.✓
- 4In a system that uses hashed page tables, if two distinct virtual addresses map to the same value while hashing, then the memory access time of these addresses will not be the same.
Correct answer
The memory access time using a given inverted page table is always the same for all incoming virtual addresses.
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Memory Management MCQs →Want more practice questions on Memory Management?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Memory Management