+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following helps keys to be mapped into addresses?

(a) hash function

(b) separate chaining

(c) open addressing

(d) chaining using a linked list

This question is from Hash Tables topic in division Hash Tables of Data Structures & Algorithms I

I had 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
The correct answer is (a) hash function

The explanation is: Hash table is an example of a data structure that is built for 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.

Categories

...