GATE CS 2022 (Forenoon) — Question 54

Computer Organization and Architecture (COA)Memory Hierarchy (Direct/Associative Cache Mapping)MSQ2 marksHard

Consider a system with 2 KB direct mapped data cache with a block size of 64 bytes. The system has a physical address space of 64 KB and a word length of 16 bits. During the execution of a program, four data words P, Q, R, and S are accessed in that order 10 times (i.e., PQRSPQRS ...). Hence, there are 40 accesses to data cache altogether. Assume that the data cache is initially empty and no other data words are accessed by the program. The addresses of the first bytes of P, Q, R, and S are 0xA248, 0xC28A, 0xCA8A, and 0xA262, respectively. For the execution of the above program, which of the following statements is/are TRUE with respect to the data cache?
  1. A
    Every access to S is a hit.
  2. B
    Once P is brought to the cache it is never evicted.
  3. C
    At the end of the execution only R and S reside in the cache.
  4. D
    Every access to R evicts Q from the cache.
Practise the full 2022-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
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