1. Solve the previous problem, assuming that the file is partitioned into 100 buckets instead of 10. 2. If we are using the division technique discussed in this chapter as a hash function and the file...

1.
Solve the previous problem, assuming that the file is partitioned into 100 buckets instead of 10.

2.
If we are using the division technique discussed in this chapter as a hash function and

the file storage area is divided into 23 buckets, which section should we search to find

the record whose key, when interpreted as a binary value, is the integer 124?

3.
Compare the implementation of a hash file to that of a homogeneous two-dimensional array. How are the roles of the hash function and the address polynomial similar?