A file system that uses 2K blocks and 4 byte pointers has two possible implementations; linked data blocks and the UNIX combined file allocation scheme with 10 direct blocks. For each implementation,...

1 Linked data blocks.
a. With the pointer size of 4 bytes the maximum number of blocks are 232. And
in each block the available file data will be 2048− 4 = 2044.
So the maximum file size will be 232 × 2044 bytes which is 8176 GB
b. The amount of data stored in a block is 2044 bytes. So a 256 GB file will
need nb blocks:
nb =
256× 230
2044
= 134480385
The amount of data in nb blocks will be
nb × 2044 = 274877906940
But still 4-bytes of data will remain from 256 GB file.
So a total of 134480386 blocks will be needed to store 256 GB file. So one
needs to access 134480384 blocks before you get to the next of last block (just
the block before the last block).
2 Unix combined...