Question: Some hash functions do not work as well as theoretically possible. Assume that we use the hash function on integer key i defined by h(i)
Some hash functions do not work as well as theoretically possible. Assume that we use the hash function on integer key i defined by h(i) = i2 mod B
What is wrong with this hash function if B = 10?
How good is this hash function if B = 16 ?
Are there values of B for which this hash function is useful ?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
