+1 vote
in Data Structures & Algorithms I by (88.2k points)
In linear probing, the cost of an unsuccessful search can be used to compute the average cost of a successful search.

(a) True

(b) False

The above asked question is from Hash Tables topic in section Hash Tables of Data Structures & Algorithms I

I have been asked this question in quiz.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Right choice is (a) True

Best explanation: Using random collision resolution algorithm, the cost of an unsuccessful search can be used to compute the average cost of a successful search.

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

...