Question

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.

Answer 1

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.