Consider a disk with sector size of 1024 bytes, 1000 tracks per surface, 50 sectors per track, 4 doublesided platters. Suppose that the disk platters rotate at 7400 rpm (revolutions per minute) and the average seek time is 7 msec. Suppose that a block (page) of 4096 bytes is chosen. Now, consider a file with 1,000,000 records of 190 bytes each that is to be stored on such a disk and that no record is allowed to span two blocks. Also, no block can span two tracks.

a. How many records fit onto a block?

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

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

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

e. 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.