For the input 30, 20, 56, 75, 31, 19, a hash table with size of 11,...

 

Transcribed Image Text:

For the input 30, 20, 56, 75, 31, 19, a hash table with size of 11, and the hash function h(K)= K mod 11 a. Construct the closed hash table using linear probing. b. What is the largest number of key comparisons in a successful search in this table? c. What is the average number of key comparisons in a successful search in this table? For the input 30, 20, 56, 75, 31, 19, a hash table with size of 11, and the hash function h(K)= K mod 11 a. Construct the closed hash table using linear probing. b. What is the largest number of key comparisons in a successful search in this table? c. What is the average number of key comparisons in a successful search in this table?