Computer Sciences > GATE 2024 SET-1 > Cache Memory
Consider two set-associative cache memory architectures: WBC, which uses the write back policy, and WTC, which uses the write through policy. Both of them use the LRU (Least Recently Used) block replacement policy. The cache memory is connected to the main memory. Which of the following statements is/are TRUE?
A
A read miss in WBC never evicts a dirty block
B
A read miss in WTC never triggers a write back operation of a cache block to main memory
C
A write hit in WBC can modify the value of the dirty bit of a cache block
D
A write miss in WTC always writes the victim cache block to main memory before loading the missed block to the cache

Explanation

Correct : b,c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science