+1 vote
in Data Structures & Algorithms I by (88.2k points)
A hash table may become full in the case when we use open addressing.

(a) true

(b) false

I'd like to ask this question from Hash Tables in chapter Hash Tables of Data Structures & Algorithms I

The question was posed to me in semester exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct choice is (a) true

The explanation is: A hash table may become full in the case when we use open addressing. But when we use separate chaining it does not happen.

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

...