Problem 56
The chapter drew parallels between a traditional file index and the file directory system maintained by an operating system. In what ways does an operating system's file directory differ from a traditional index?
Problem 57
If a hash file is partitioned into 10 buckets, what is the probability of at least two of three arbitrary records hashing to the same bucket? (Assume the hash function gives no bucket priority over the others.) How many records must be stored in the file until it is more likely for collisions to occur than not?
Problem 60
Compare the implementation of a hash file to that of a homogeneous twodimensional array. How are the roles of the hash function and the address polynomial similar?
Problem 61
Give one advantage that a. a sequential file has over an indexed file. b. a sequential file has over a hash file. c. an indexed file has over a sequential file. d. an indexed file has over a hash file. c. a hash file has over a sequential file. f. a hash file has over an indexed file.
Problem 62
Explain the technique of hashing. How is it related to a hash function and a hash table?
