+1 vote
in Data Structures & Algorithms I by (88.2k points)
What kind of deletion is implemented by hashing using open addressing?

(a) active deletion

(b) standard deletion

(c) lazy deletion

(d) no deletion

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

I have been asked this question by my college director while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (c) lazy deletion

Explanation: Standard deletion cannot be performed in an open addressing hash table, because the cells might have caused collision. Hence, the hash tables implement lazy deletion.

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.