$\underline{\textbf{Answer: C }}$
$\underline{\textbf{Explanation: }}$
$\textbf{Option (A):}$
TLB is like a Fully Associative Cache. We know that in the fully associative cache, the search is made on the basis of $\color {red}{\textbf{Content}}$ rather than the $\color {red}{\textbf{Address}}$. It matches all the Tags parallelly and at once. Therefore, Option (A) looks TRUE as well.
$\textbf{Option (B):}$ This option is TRUE as well.
$\underline{\textbf{Control Flow:}}$
- First, we go to Cache Memory, and if there is a cache hit, then no problem.
- In case there is a cache miss, we go to the next step.
- In this step we will go to the TLB, if there is TLB Hit. Then, we will go to the physical memory using the physical address.
- In case there is a TLB Miss, then we will access the “page table”, in order to obtain the frame number.
- If the page is not found, then it means that there is a “page fault”. At this juncture, we will use one of the page replacement algorithms, in order to obtain the page from secondary memory to physical memory.
https://en.wikipedia.org/wiki/Translation_lookaside_buffer#:~:text=The%20TLB%20is,data%20address%20TLBs.
$\textbf{Option (C):}$
An inverted Page Table is nothing but a Hash Map. So, with the same logic as D option C looks False.
$\textbf{Option (D):}$
This is true as when two values are mapped to the same address, then the values are added in form of a linked list. In the best case for the first element of the linked list, time complexity will be $\mathbf{O(1)}$, and for the last element of the chained linked list, time complexity will be $\mathbf{O(n)}$.
$\textbf{ Good Links:}$
https://stackoverflow.com/questions/37825859/cache-miss-a-tlb-miss-and-page-fault
https://cs.stackexchange.com/questions/66698/difference-between-page-table-and-inverted-page-table