Home / Engineering / Database Management System (DBMS) / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?

(A) all keys hash to same index
(B) all keys hash to different indices
(C) all keys hash to an even-numbered index
(D) all keys hash to different even-numbered indices
Correct answer : Option (A) - all keys hash to same index

Share

Discusssion

Login to discuss.