ISRO | CS | 2016 | Data Structures | Hashing | Question 26

Last Updated :
Discuss
Comments

A Hash Function f is defined as f(key) = key mod 7. With linear probing, while inserting 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 0thlocation)?

3

4

5

6

Share your thoughts in the comments