Computer Science · Computer Organization
Let WB and WT be two set-associative cache organizations that use the LRU algorithm for cache block replacement. WB is a write-back cache and WT is a write-through cache. Which of the following statements is FALSE?
- 1Every write hit in a write-back cache (WB) leads to an immediate data transfer from cache to main memory.✓
- 2Each cache block in a write-back cache (WB) requires a dirty bit.
- 3A read miss in WB may lead to the eviction of a dirty block, causing a write to main memory.
- 4Eviction of a block from a write-through cache (WT) does not lead to a data transfer from cache to main memory.
Correct answer
Every write hit in a write-back cache (WB) leads to an immediate data transfer from cache to main memory.
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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Computer Organization?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Computer Organization