The TLB performs an associative search in parallel on all its valid entries using page number of incoming virtual address.
If the virtual address of a word given by 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.
The memory access time using a given inverted page table is always same for all incoming virtual addresses.
In a system that uses hashed page tables, if two distinct virtual addresses V1 and V2 map to the same value while hashing, then the memory access time of these addresses will not be the same.
Correct answer: (C) The memory access time using a given inverted page table is always same for all incoming virtual addresses.
Explanation
**(A) True.** A TLB is an associative (parallel) cache of page-table entries.
**(B) True.** A TLB hit means the page is in main memory, so any word of that page is too, even if it is not in the (smaller) cache.
**(C) False.** An inverted page table is searched through a hash and possibly a chain of colliding entries, so lookup time **varies** with the address.
**(D) True.** In a hashed page table, addresses that hash to the same bucket sit on a chain, so the later ones take longer to find (different access times).
The false statement is (C).
More Memory Management and Virtual Memory questions
GATE 2022 CS Q64– Consider a demand paging system with four page frames (initially empty) and LRU page…
GATE 2021 CS (CS1) Q21– In the context of operating systems, which of the following statements is/are correct with…
GATE 2020 CS Q21– Consider allocation of memory to a new process. Assume that none of the existing holes in…
GATE 2020 CS Q63– Consider a paging system that uses 1-level page table residing in main memory and a TLB…
GATE 2018 CS Q20– Consider a process executing on an operating system that uses demand paging. The average…
GATE 2015 CS (CS1) Q29– Consider a system with byte-addressable memory, 32-bit logical addresses, 4 kilobyte page…