+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is direct addressing?

(a) Distinct array position for every possible key

(b) Fewer array positions than keys

(c) Fewer keys than array positions

(d) Same array position for all keys

I want to ask this question from Hash Tables topic in section Hash Tables of Data Structures & Algorithms I

The question was posed to me by my college director while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct option is (a) Distinct array position for every possible key

To explain: Direct addressing is possible only when we can afford to allocate an array that has one position for every possible key.

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

...