2.3k views

Consider a direct mapped cache of size 32 KB with block size 32 bytes. The CPU generates 32 bit addresses. The number of bits needed for cache indexing and the number of tag bits are respectively,

1. 10, 17
2. 10, 22
3. 15, 17
4. 5, 17
retagged | 2.3k views

Number of blocks $= \dfrac{\text{cache size}}{\text{block size}}= \dfrac{32\text{-KB}}{32}=\text{1024-Bytes.}$

So, indexing requires $\text{10-bits}.$ Number of OFFSET bits required to access $\text{32-bit block} = 5.$
So, number of TAG bits $= 32 - 10 - 5 = 17.$

edited
0
sir if question ask like that " how many bits required to index the words present in cache" than ans would be c option.??
0
@kunal ;

..
+7
Indexing is for arrays. Cache is an array of cache lines/blocks. So, we won't say "index  a word" in cache.
0
@Arjun sir, This is virtually addressed cache?
0
but the cache index is equal to line offset plus word offset???