Answer:
1. a) be relatively easy to calculate.
b)map all the possible key values into the range of the valid hash table indices.
c) returns smaller values more frequently than larger values.
2) number of entries required in a hash table = bucket size * load factor
= 120 *.75= 90
Each reference size =4 and we need not worry about the space taken by each object themselves.
Hence, size = 90 x 4 =360 bytes.
Explanation:
Remember the hash functions must ensure ease in calculation. And the rest of the features are the salient feature of the hashset.
And Load factor = number of entries required in a hash table / bucket size.
