#sets=2^11
block size=16 bytes
element size=8 byte
#elements in one block=2
each set contain=2 blocks set 0:: A[0][0] | A[0][1]
#elements in one set=4 elements A[0][2] | A[0][3]
total no.of elements covered in 2^11 sets = 2^11*4=2^13 ELEMENTS set 1:: A[0][4] | A[0][5]
A[0][0]..........................A[0][1023]=2^10 ELEMENTS A[0][6] | A[0][7]
A[1][0]..........................A[1][1023]=2^10 ELEMENTS
A[2][0]..........................A[2][1023]=2^10 ELEMENTS
A[3][0]..........................A[3][1023]=2^10 ELEMENTS
TOTAL ELEMENTS COVERED FROM A[0][0] ............................A[3][1023]=2^10 + 2^10 + 2^10 +2^10 = 2^12 elements ..
TOTAL sets COVERED FROM A[0][0] ............................A[3][1023] = (total elements covered)/(no.of elements in one set)= (2^12)/4= 2^10 sets covered...
NOW we have 2^11 sets and only 2^10 covered how a[4][0] is the answer ..............................
MY QUESTION IS --------------
IS AM I PREDTENDING IT LIKE DIRECT MAPPING?????
HELP ME @Arjun SIR