Question: Suppose we use the hash function h(x) = x mod 7 (i.e. h(x) is the remainder of the division of x by 7) to hash
Suppose we use the hash function h(x) = x mod 7 (i.e. h(x) is the remainder of the division of x by 7) to hash into a table with 7 slots (the slots are numbered 0, 1,, 6) the following numbers: 32, 57, 43, 20, 28, 67, 41, 62, 91, 54. We use chaining to handle collisions. Which slot contains the longest chain?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
