+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following is used in hash tables to determine the index of any input record?

(a) hash function

(b) hash linked list

(c) hash tree

(d) hash chaining

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

This question was posed to me in semester exam.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Right option is (a) hash function

Easiest explanation - 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

...