+1 vote
in Data Structures & Algorithms I by (88.2k points)
In hash tables, how many traversal of links does a successful search require?

(a) 1+⅄

(b) 1+⅄^2

(c) 1+ (⅄/2)

(d) ⅄^3

My query is from Hash Tables topic in portion Hash Tables of Data Structures & Algorithms I

I had been asked this question by my school principal while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right option is (c) 1+ (⅄/2)

Explanation: A successful search requires about 1+ (⅄/2) links to be traversed. There is a guarantee that at least one link must be traversed.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...