Quadratic probing algorithm uses two hashing functions. First function is used for finding the hashed bucket of the key value. In case of a conflict the resolution is tried using second function. Use following functions to find the bucket for following number. Ist function: 3K + 2 % 10 2 nd Hash function: 2K + 3 % 10 Keys: 3, 12, 11, 7, 9, 10, 15, 21, 24, 14 Your answer should include The contents of hash table after each entry Hashed values of each key using 1 st function and in case of collision the 2 nd function. Number of probes for each key and values calculated in each probe. Original and final location in case of collision The keys that cannot be inserted. Use the data of question 3 above and Double hashing function to identify the bucket of hashed key. Use same hash functions as in Question 3. Your answer should include The contents of hash table after each entry Hashed values of each key using 1 st function and in case of collision the 2 nd function. Number of probes for each key and values calculated in each probe. Original and final location in case of collision The keys that cannot be inserted. .

1. Quadratic probing algorithm uses two hashing functions. First function is used for finding the
hashed bucket of the key value. In case of a conflict the resolution is tried using second function.
Use following functions to find the bucket for following number.
Ist function: 3K + 2 % 10 2 nd
Hash function: 2K + 3 % 10
Keys: 3, 12, 11, 7, 9, 10, 15, 21, 24, 14
Your answer should include
The contents of hash table after each entry
Hashed values of each key using 1 st
function and in case of collision the 2 nd
function.
Number of probes for each key and values calculated in each probe.
Original and final location in case of collision
The keys that cannot be inserted.
Use the data of question 3 above and Double hashing function to identify the bucket of hashed
key. Use same hash functions as in Question 3.
Your answer should include
The contents of hash table after each entry
Hashed values of each key using 1 st
function and in case of collision the 2 nd
function.
Number of probes for each key and values calculated in each probe.
Original and final location in case of collision
The keys that cannot be inserted.