"And we always calculate the set bits and offset bits and put the remaining in tag bits, not the other way"....yes that's what I am saying...we first calculate set bits(log 128 = 7), and then word bits(log 8 = 3), and finally tag bits, which equals 32-(7+3) = 22 bits.
In the book I am reading , the author divides the address into 3 parts..TAG : SET : WORD .
"By default we assume byte addressing"...should I solve questions by always assuming byte addressing in gate??
Thanks in advance.