a 10. [5 points] Consider a hash table of size 11 with a hash function h(x) = (2x+5) mod a 11. Generate a table with the

[answerhappygod]

A 10 5 Points Consider A Hash Table Of Size 11 With A Hash Function H X 2x 5 Mod A 11 Generate A Table With The 1 (104.1 KiB) Viewed 22 times

a 10. [5 points] Consider a hash table of size 11 with a hash function h(x) = (2x+5) mod a 11. Generate a table with the initial hash code estimation. Show the table that results after inserting in that order, entries with the following keys: 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5. Show one version of the table when collisions are handled via linear probing (show the entry stored and the number of displacements per index), and another when separate chaining is used instead (show all the buckets and their appended entries).