Question

Question 1 (Hash Table, N = 11, NOT 10) Given input 11 98 64 46 35 71 84 21 34 47 and a hash function h(x) = x mod 11 (NOT 10) show the resulting a) separate chaining hash table b) hash table - linear probing c) hash table - quadratic probing d) hash table - second hash function $h_2(x) = 7 - x \mod 7$ You may combine (b) - (d) into one table with columns for each.

          Question 1 (Hash Table, N = 11, NOT 10)
Given input
11 98 64 46 35 71 84 21 34 47
and a hash function h(x) = x mod 11 (NOT 10)
show the resulting
a) separate chaining hash table
b) hash table - linear probing
c) hash table - quadratic probing
d) hash table - second hash function $h_2(x) = 7 - x \mod 7$
You may combine (b) - (d) into one table with columns for each.

Question 1 (Hash Table, N = 11, NOT 10)
Given input
11 98 64 46 35 71 84 21 34 47
and a hash function h(x) = x mod 11 (NOT 10)
show the resulting
a) separate chaining hash table
b) hash table - linear probing
c) hash table - quadratic probing
d) hash table - second hash function h2(x) = 7 - x 7
You may combine (b) - (d) into one table with columns for each.

Added by Zachary F.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Maanya Naveen

Step 1

Then, we insert the elements into the linked lists based on their hash values. Hash Function: h(x) = x mod 11 Index 0: Index 1: 1198 -> 71 Index 2: Index 3: Index 4: 8421 Index 5: Index 6: Index 7: Index 8: Index 9: 644635 Index 10: 34 -> 47 Show more…

Show all steps

Thanks for your feedback!

Hash Table, N=11, NOT 10 Given input: 1198, 644635, 71, 8421, 34, 47 and a hash function h(x) = x mod 11 (NOT 10), show the resulting: a) separate chaining hash table b) hash table - linear probing c) hash table - quadratic probing d) hash table - second hash function h(x) = 7 - x mod 7 You may combine (b)-(d) into one table with columns for each.