Answer D
A) TRUE. We do not need a replacement algorithm for Direct Mapped Cache as there is not much decision to make. Since a block from memory can go to only one line in cache
B) TRUE. LRU can be used for associative and set associative caches. However, when the associatively increases, the cost of implementation increases and it becomes prohibitive to use is efficiently. In such a case, Pseudo-LRU is preferred.
C) TRUE. Write back approach means, whenever can update is made in cache, update it in cache only
D) FALSE. Write through means, whenever update is made, replace data in all levels cache and memory
Ref:
https://en.wikipedia.org/wiki/Pseudo-LRU
https://web.cs.iastate.edu/~prabhu/Tutorial/CACHE/bl_replace.html
http://www.cs.iit.edu/~cs561/cs350/caching/7.html
