Consider a disk with sector size of 512 bytes, 2000 tracks per surface, 50 sectors per track, 5 double-sided platters. Suppose that the disk platters rotate at 7400 rpm (revolutions per minute) and the average seek time is 8 msec.

Suppose that a block of 1024 bytes is chosen. Now, consider a file with 100,000 record of 210 bytes each that is to be stored on such a disk and that no record is allowed to span two blocks.

How many records fit onto a block?

How many blocks are required to store the entire file? If the file is arranged sequentially on the disk, how many surfaces are needed?

How many records of 100 bytes each can be stored using this disk?

What time is required to read a file containing 100,000 records of 100 bytes each, sequentially?

What is the time required to read a file containing 100,000 records of 100 bytes each in a random order? To read a record, the block containing the record has to be fetched from disk. Assume that each block request incurs the average seek time and rotational delay.