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