Question: Insert the following keys into an initially empty hash table of size 7: 7, 9, 18, 51, 33, 30. Show the resulting hash table, using
Insert the following keys into an initially empty hash table of size 7: 7, 9, 18, 51, 33, 30. Show the resulting hash table, using the division method to generate hash values with hash function h(x) = x mod 7.
a. Using open hashing (i.e. chaining).
b. Using closed hashing (open addressing) with linear probing.
c. Using closed hashing (open addressing) with quadratic probing, C0= C1=0, C2=1.
d. Using double hashing with the secondary hash function h2(x) = 5 (x mod 5).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
