A file is stored on a disk system. The disk is 1 MB in size and has disk blocks of size 1 KB. The file is stored in sequential order in 4 disk blocks: 20, 500, 10, and 900. The last disk access was to block 51 and the directory entry for the file is stored in block 50. The first disk block is numbered block 0.
(1)Suppose a linked disk allocation method is used. What is the total seek distance
for reading the entire file from beginning to end? Assume that the directory entry for the file stored in block 50 is in the memory already.
(2)Suppose a FAT allocation method is used, what is the total seek distance for appending and storing data in disk block 600 at the end of the file? Suppose the entire FAT is stored in memory and you don't have to updating the FAT table in the disk.
(3)Suppose an indexed disk allocation method is used and the index block contains 2- byte direct entries (meaning the length of the pointers in mode is 2-byte long). If the index is stored in block 55, what is the total seek distance for reading the entire file from beginning to end?
Suppose an indexed disk allocation method is used and the index block only contains 1-byte direct entries. If the disk contains 1024 files, what is the maximum size file possible (in bytes)? Hint: These file will contain at least one block.