Consider the i-node shown below. If it contains 10 direct addresses and these were 8 bytes each and all disk blocks were 1024 KB, what would the largest possible file be?
I can't understand how to tackle this problem.
Considering that "all disk blocks were 1024 KB" and entries are 8 bytes, the indirect block can hold 128 address. So we have 10 direct address + 128 indirect addresses for a total of 138 addressable disk blocks.
The official solution says "Since each block is 1KB, the largest file is 138KB".
Why? The text says that all blocks are 1024KB, how can be that now blocks are 1KB?