Question

List the final state of the cache, with each valid entry represented as a record of < index, tag, data >.

Answer 1

There is not enough information to give correct answer. Anyway, I guess, I've seen this question before and I know the answer. I wrote it in binary. So if your task's details look like this: tag bits 31-10 2; index bits 9-4; offset bits 3:0; your answer is:

<000000, 0001, mem[1024]>
<000001, 0011, mem[3088]>
<001011, 0000, mem[176]>
<001000, 0010, mem[2176]>
<001110, 0000, mem[224]>
<001010, 0000, mem[160]>