1) The major advantage of hashed data structures is _________________________

2) In a non-perfect hashed structure, every key is mapped into a unique index into the array, True or False? ___________

3) When keys are non-numeric values preprocessing is always performed, True or False? ________

4) When two keys map into the same array index, we say a _________________has occurred.

5) The array of a non-perfect hashed data structure contains 769 elements. What element does the key 351,956 map into if no preprocessing is performed, and the division hashing function is used? _____________________________________

6) A hashed data structure will store a maximum of 4,352 nodes, the keys are numeric in the range is 0 to 999,999, and the node width is 60 bytes. (show your work)

a) Give the size of the primary storage area array if perfect hashing is used _________________

b) Give the size of the primary storage area array if non-perfect hashing is used _____________

c) Give the loading factor when the structure is full and perfect hashing is used ______________

d) Give the density when the structure is full and perfect hashing is used ___________________

e) Give the density when the structure is full and non-perfect hashing is used _______________