Question: 2(20 points): Hashing Suppose we would like to insert a sequence of numbers into a hash table with table size 8 using the three open

2(20 points): Hashing Suppose we would like to insert a sequence of numbers into a hash table with table size 8 using the three open addressing methods, with the primary hash function h(kk mod 8 the secondary hash function h2(k)1 (k mod 7), and the constants cc1/2 (in quadratic probing) (a)(10 points) If the sequence of numbers is , please successively insert these numbers into the following tables. index linerquadraticdouble (b)(3 points) For the hashing functions and table size we used in part (a), does the linear probing fully utilize the table? How about the quadratic probing and double hashing? (c)(7 points) A hash table with size 10 stores 6 elements. These 6 elements are stored in To, T], T4], T[6], T7,Ti9. Suppose that all the other entries contain no "deleted" flag. An entry has a "deleted" flag means that this entry stored an element before, but the element has already been deleted. If we would like to search an element with a key k and assume the linear probing technique is used, what is the expected number of probes for an unsuccessful search
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
