1.

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)?(A) 3(B) 4(C) 5(D) 6

Answer»


Discussion

No Comment Found

Related InterviewSolutions