Teaching HPSC Lecturer (Technical) Mock Test 2024 Algorithms Searching, Sorting and Hashing Searching
Consider a hash table of size m = 7 and a corresponding hash function h(k) = k mod 7, where a value of k is computed using a folding method. In folding method key is divided into some segment of length 3. Compute the location to which the key 749287198 is mapped. An Index of the hash table starts from 0.
1
1
2
2
3
3
4
4
5
Question Not Attempted