Question: this is in C++ The following hash table is built using the hashing function h (k) k%15 and Quadratic probing: f(k, i)-(h (k) + i*)
this is in C++
The following hash table is built using the hashing function h (k) k%15 and Quadratic probing: f(k, i)-(h (k) + i*) % 15 Where i starts at zero and increments by one each time the probing formula results in collision 0 1 23 4 5 6 789 10 1112 13 14 47 33 4 19 48 34 9 11 63 28 Answer the following questions: 8. What is the load factor of the hash table? (1 pt) 9 What is the maximum number of probes for a successful search? (1 pt) 10. What is the average number of probes for a successful search? (1 pt) 11. What is the maximum number of probes for an unsuccessful search? (1 pt) 12. What is the average number of probes for an unsuccessful search?(1 pt)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
