GATE 2014 CS (CS1) – Question 54

Computer Organization and Architecture · Memory Interfacing and Hierarchy · 2 marks · Multiple choice

A length-N cache-block access sequence contains n unique addresses. Distinct block addresses between consecutive accesses to the same block are bounded above by k. Find miss ratio for a cache of associativity A ≥ k using least-recently-used replacement.

$n/N$
$1/N$
$1/A$
$k/n$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (A) $n/N$

Explanation

The intended reasoning is that all accesses after a block’s first are hits, leaving n compulsory misses in N accesses, giving **n/N,A**. Strictly this needs fewer than A distinct intervening competing blocks; the printed A≥k with an inclusive k bound permits eviction at A=k. The official answer retains the intended sufficient-capacity assumption.