+1 vote
in Data Structures & Algorithms I by (88.2k points)
Hashing is the problem of finding an appropriate mapping of keys into addresses.

(a) True

(b) False

This is a very interesting question from Hash Tables in chapter Hash Tables of Data Structures & Algorithms I

I have been asked this question in homework.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct option is (a) True

Easiest explanation - Hashing is a data structure which is used to locate data in a table based on a key value.

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

...