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
Write the postfix form of the expression: (a + b) * (c - d)
What is max heapify?
Differentiate between push and pop?
Define right-in threaded tree?
What is the use of treemap?
Define quadratic probing?
Define linear probing?
What are the parts of a linked list?
What are different methods of collision resolution in hashing.
Is Arraylist faster than Array? Why?
What is a vector class?
What is list and its types?
What is the purpose of thread?
Explain different methods in which you can traverse a tree?
What is the use of sorting?