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
Does hashmap preserve insertion order?
Is hashset thread safe?
How many times is merge sort called?
Differentiate null and void?
What do u mean by data type?
Which interfaces are implemented by concurrentskiplistset?
What is the Difference between sax and dom parser?
Why is it called bubble sort?
What is the maximum size of array?
Is a hash table a map?
What is difference between list and linked list?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
Explain the term tail recursion?
How many types of searching are there in data structure?
What is the use of sorting?