Consider a disk with a sector size of 512 bytes, 1,000 tracks per plater, 100 sectors per track, 10 tracks per cylinder and a block size of 2,048 bytes including 48 bytes for non-data overhead. Suppose that a file containing 1,000,000 records of 100 bytes each is to be stored on such a disk and that no record can span two blocks. a) How many records fit onto a block? b) How many cylinders are required to store the entire file?

The performance of a file system depends upon the cache hit rate (fraction of blocks found in the cache). If it takes 1 msec to satisfy a request from the cache, but 40 msec to satisfy a request if a disk read is needed, give a formula for the mean time required to satisfy a request if the hit rate is h. Plot this function for values of h varying from 0 to 1.0. Explain your logic and justify the structure of the formula.

On a 16 GB hard disk drive (HDD), each cluster consists of 32 sectors and each sector has a fixed size of 512 bytes. A text file with a size of 150,000 bytes is to be stored. a.  i.How many clusters does the text file take up in memory? ii.What is the size of the slack space, in bytes, once the file has been stored?

For Heap File with a page directory, assume that a page can contain up to 100 directory entries and a page can contain 1000 records, for a file of 1,000,000 records, what is the number of pages to store these records, assuming that on average data pages are filled up 70%? With this data page utilization, what is the number of pages to store the directory, assuming that each directory page is full? Assuming both the directory and the file are stored on disk, what is the I/O cost to insert one record in worst case, and in the average case?