Consider a disk on which the rate at which it can read sequentially laid out data is 100 MBps. Average seek time on the disk is 5 milliseconds and that the disk rotates at 5400 RPM. You may ignore transfer delays (i.e., consider only seek time and rotational latency). Assume all indexing blocks (directory/i-node) are cached in memory; you only have to account for the data block accesses. If you need to, you may assume that each track holds 200 blocks.
(1) If the block size used by the file system is 4 KB and all blocks are randomly distributed across the disk, how long will it take for an application to read a file of size 1 GB?
(2) Repeat 1, assuming that the blocks were allocated contiguously.