Quiz submission record for quiz6-2-1 at Wed Jul 28 03:48:16 2004:

Your Answer for Question 1:
Counting from zero, location 5 (i.e. the sixth location).

Since 53 in binary is 110101 and the low three bits are the address of the cache location (101 == 5), the tag field would be 110 (with any neccesary leading zeros) or in decimal, 6.

Your Answer for Question 2:
In the before version, the loop will traverse the two-dimensional array by incrementing i each inner loop. Since the array is stored in memory as i arrays of j, the j elements are contigious in an array and the i elements of a given j are 21 elements apart from each other. Visiting each j sucessively will cause more cache hits since in a multi-word block cache the word will be in the cache since we just visited the prior element, much more often than it would in the first version.


Your unique submission ID is quiz6-2-1-cs61c-cm-1091011696-3311.