No. of elements in 1 block = 128/8 = 16
Block 0: A[0][0] to A[0][15]
Block 1: A[0][16] to A[0][31] and so on...
Now,
i=0,
A[0][0] is not present in the cache. Hence a miss (compulsory miss). For the next 15 elements, there is no miss, (j=1 to j=15). j takes values from 0 to 512 and there is a miss after every 16 elements. Hence the total number of misses when i=0 is (512/16) = 32.
Hence, for i=0 to i=512, number of misses
=No. of iterations * No. of misses in one iteration
=(2^9 * 2^5) = 16834
Option A