Suppose there are seven students with IDs 5701, 9302, 4210, 9015, 1553, 9902, and 2104. Suppose hash table, HT, is of the size 19, indexed 0,1,2, …, 18. Show how these students’ IDs, in the order given, are inserted in HT using the hashing function h(k) = k % 19. Use double hashing to resolve collision, where the second hash function is given by −g(k) = (k+1) % 17.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.