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
Please Help Members By Posting Answers For Below Questions
What is the Role of push() and pop() method?
Is sorting a math skill?
Define open addressing?
How do you use merge sort?
Why you need a data structure?
Define general trees?
Which is faster hashmap or treemap?
How helpful is abstract data type of data structures?
What are the applications of stack?
What is circular queue example?
Why hashmap is faster than hashset?
Describe tree database.
Can treeset contain null?
State the properties of b tree.
Can hashtable have duplicate values?
