+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the advantage of the hash table over a linked list?

(a) faster access of data

(b) easy to implement

(c) very efficient for less number of entries

(d) exhibit good locality of reference

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

The question was posed to me during an internship interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right answer is (a) faster access of data

Easy explanation - Hash table is a data structure that has an advantage that it allows fast access of elements. But linked list is easier to implement as compared to the hash table.

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

...