Reply To:

A hash table with 10 buckets with one slot per bucket is depicted here. The symbols, S1 to 57 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is

(A) 4
(B) 5
(C) 6
(D) 3

Home Modern › Forums › ISRO ›

A hash table with 10 buckets with one slot per bucket is depicted here. The symbols, S1 to 57 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is

(A) 4
(B) 5
(C) 6
(D) 3

› Reply To:

A hash table with 10 buckets with one slot per bucket is depicted here. The symbols, S1 to 57 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is

(A) 4
(B) 5
(C) 6
(D) 3