The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+11 votes
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
asked in CO & Architecture by Veteran (59.4k points)
retagged by | 2.3k views

1 Answer

+18 votes
Best answer

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.$

So, answer is (A).

answered by Veteran (342k points)
edited by
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?
(as cpu generates virtual address)
0
but the cache index is equal to line offset plus word offset???
Answer:

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

35,499 questions
42,766 answers
121,499 comments
42,151 users