Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Algorithms Searching, Sorting and Hashing Searching
A hash function f defined as f(key) = key mod 7, with linear probing insert the keys 37, 38, 72, 48, 98, 11, 56, into a table indexed from 0, in which location the key 11 will be stored (Count table index 0 as 0th location)?
1
3
2
4
3
5
4
6
5
Question Not Attempted