GATE CSE 2022 Q24: False statements about write-back and write-through caches
- Computer Organization and Architecture
- 1 mark
- MSQ
- No negative marking
Question
Let WB and WT be two set associative cache organizations that use 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/are FALSE?
Try it: multiple select: one or more correct options
Show answer and explanation
Answer: A, B, D (official GATE 2022 final answer key)
Concept used: Write-through keeps memory current on every write (no dirty bit needed); write-back writes a block to memory only when a dirty block is evicted.
First step: For each statement, ask when each policy actually writes to main memory.
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2022 CS question paper and final answer key, organised by IIT Kharagpur. Question paper · Answer key
More Computer Organization and Architecture PYQs
- 2026 Session 1 · Q14Match addressing modes with high-level data elements
- 2026 Session 1 · Q15Instruction sequence for Z = X + Y on a load-store machine
- 2026 Session 1 · Q16Register dependency that causes a data hazard
- 2026 Session 1 · Q36IEEE 754 single-precision sum of 35C00000 and 34A00000
- 2026 Session 1 · Q38Tag length: direct-mapped vs K-way set-associative cache
- 2026 Session 1 · Q54Impossible TLB / page table / cache event sequences