UGC NET CSE | December 2009 | Part 2 | Question: 25

Question

A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6.

What will be the location of 11 ?

(A) 3

(B) 4

(C) 5

(D) 6

Answer 1

given hashing function

f(key) = key mod 7

with linear probing

LP(k,i) = (f(key) + i) mod 7

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