engineering recuitment GATE CSE 2023-24 Test Series Algorithms Searching, Sorting and Hashing Searching
A hash function h defined as h(k) = k mod 7, with linear probing, insert the keys 37,38,72,48,98,11,56, into a table indexed from 11 will be stored in the location
1
3
2
7
3
2
4
5