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

(a) faster access of data

(b) easy to implement

(c) very efficient for less number of entries

(d) exhibit good locality of reference

My enquiry is from Hash Tables topic in chapter Hash Tables of Data Structures & Algorithms I

The question was asked in homework.

1 Answer

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

Explanation: Hash table is a data structure that has an advantage that it allows fast access of elements. Hash functions are used to determine the index of any input record in a 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.