Assume one file has r =106 records. Each record takes R = 100 bytes, of which 10 bytes are for the key of the record. Suppose the key values range from 1 through 1,000,000, inclusive. Assume the block size B is 1000 bytes for all files, and that an address (block pointer, tree node pointer, or data record pointer) takes 10 bytes.
1. Sequential file: (15 points)
a. What is the blocking factor bfr for the file ?
b. How many data blocks b are needed to hold records ?
c. How many data blocks accesses on the average are needed to fetch a record by using linear search ?
d. How many data blocks accesses are needed to fetch a record by using binary search ?