The exercise states that we have a data size of 512 bytes,and 4 double words per block, address bus is 64 bits and system uses byte addressing, then we’re given the following hexadecimal addresses:
0x01C, 0x832, 0x217, 0x424, 0x212, 0x822, 0x01 and have to fill a table where you have to put the binary address , the tag , the index, the word offset and byte offset as well as the hits/misses and the content after accessing of each of the addresses. What I cant get around is the word offset, I’ve been reading the book recommended by our professor as well as his slides but couldn’t find a single clue about it, I understand the byte offset as the bits required for byte addressing, is the word offset part of the byte offset or is it calculated in a different way?

I tried to solve it by myself but don’t know if I answered it correctly