Question

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 0^th location)?

1. 3
2. 4
3. 5
4. 6

Answer 1

Correct Answer - Option 3 : 5

Location	Key
0	98
1	56
2	37
3	38
4	72
5	11
6	48