GATE CS 2022 (Forenoon) — Question 24

Computer Organization and Architecture (COA)Memory Hierarchy (Direct/Associative Cache Mapping)MSQ1 markMedium

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?
  1. A
    Each cache block in WB and WT has a dirty bit.
  2. B
    Every write hit in WB leads to a data transfer from cache to main memory.
  3. C
    Eviction of a block from WT will not lead to data transfer from cache to main memory.
  4. D
    A read miss in WB will never lead to eviction of a dirty block from WB.
Practise the full 2022-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Memory Hierarchy (Direct/Associative Cache Mapping)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group