328 views
0 votes
0 votes

 my answer 5 plz check but answer given 4 

1 Answer

1 votes
1 votes
Answer given by them is absolutely right... I think the problem with your solution is that you are including the additional bits..

You must understand the question.. It is asking for additional bits in cache directory,not for the tag bits..

Therefore.. 16 bits will be for tag

5 bits for block size and 11 bits for sets..

#of cache lines are (2^8 * 2^10)/2^5= 2^13

#of sets =2^11=2^13/k

Then k should be equal to 4.

Related questions

0 votes
0 votes
2 answers
1
Hradesh patel asked Dec 22, 2017
324 views
0 votes
0 votes
0 answers
2
Hradesh patel asked Dec 22, 2017
399 views
0 votes
0 votes
0 answers
3
Hradesh patel asked Dec 22, 2017
278 views
1 votes
1 votes
0 answers
4
cse23 asked Jul 31, 2016
364 views
which of below is recursively enumerable language:a. <M | M is turing macjine and there exist a input whose length is less than 100, on which M halts>b.{M is a turing mac...