Question

A file has r = 20,000 STUDENT records of permanent length. Each record has following fields-

Name (30 bytes), Ssn (9 bytes), Address (40 bytes), PHONE (10 bytes), Birth_date (8 bytes), Sex (1 byte), Major_dept_code (4 bytes), Minor_dept_code (4 bytes), Class_code (4 bytes, integer), and Degree_program (3 bytes).An extra byte is used as a removal marker. The file is stored on disk whose parameters are given -

a. Calculate record size R in bytes.

b. Calculate blocking factor bfr and the number of file blocks b, assume an unspanned organization.

c. Calculate average time it takes to discover a record by doing a linear search on the file if

(i) the file blocks are stored contiguously, and double buffering is used;

(ii) the file blocks are not stored closely.

d. Assume that the file is ordered by Ssn; by doing a binary search, compute the time it takes to search for a proof given its Ssn value.