1,014 views
0 votes
0 votes

i think option b is correct

3 Answers

3 votes
3 votes
Answer B

Yes true .. Simple formula ..

Tag bits in K-way = log( size of MM / size of CM ) + log(k)

here ... tag bits = log(2^p / 2^n ) + Log k  = log(2^(p-n) ) + log(k) = p - n + log(k)
1 votes
1 votes
Physical Address space is 2^P bytes i.e. P bits to represent total memory.
Cache Size 2^N i.e. bits to represent Cache memory.

K way associative.

(Size of Tag in bits) + (Cache Size/K in bits) = (Total memory in bits)
(Size of Tag in bits) + N-log(K) = P
(Size of Tag in bits) = P - N + log(K)

Related questions

1 votes
1 votes
1 answer
1
dark.hacker.beyhadh asked Feb 6, 2018
1,228 views
In gate 2018 cs paper, we need to tell whether its in safe state or not? and we were not given last resource... so when i solved i was in deadlock. Does anyone remember t...
2 votes
2 votes
1 answer
2
ashish pal asked Dec 4, 2017
999 views
2 votes
2 votes
0 answers
3
Harikesh Kumar asked Sep 17, 2017
221 views