Answer Posted / umesh
Hashing is a way to retrieve/store data on a constant time
independent of the value and position of the data present.
The position is a typically a function of the data stored.
| Is This Answer Correct ? | 6 Yes | 3 No |
Post New Answer View All Answers
Will arraylist maintain insertion order?
Can arraylist contain duplicates?
What is a bubble sort and how do you perform it?
If you are given a choice to use either arraylist and linkedlist, which one would you use and why?
What is the space complexity of quicksort?
How do you do a mergesort?
What method is used to place a value onto the top of a stack?
Describe the types of data structures?
which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?
Explain what is linear search?
Are linked lists considered linear or non-linear data structures?
What is stable sort?
Why sorting is done?
Why is sorting and classifying important?
Can constructor be static?
