engineering recuitment GATE CSE 2023-24 Test Series Algorithms Searching, Sorting and Hashing Searching
Consider a hash table of size 7, with hash function H (k) = k % 7, and pseudo random i = (i + 5) % 7. We want to insert the following keys one by one from left to right.
15, 11, 25, 16, 9, 8, 12
What will be the position of the key 25, if we use random probing?1
4
2
5
3
1
4
2