+1 vote
in Data Structures & Algorithms I by (88.2k points)
In open addressing the hash table can never become full.

(a) True

(b) False

My doubt stems from Hash Tables in section Hash Tables of Data Structures & Algorithms I

I had been asked this question during an internship interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (b) False

Easy explanation - There are two methods of handling collisions in a hash table:- open addressing and separate chaining. In open addressing the hash table can become full.

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.