What are the types of Collision Resolution Techniques and the methods used in each of the type?
Answer Posted / ajay vikram
Open addressing (closed hashing),
The methods used include:
Overflow block,
Closed addressing (open hashing)
The methods used include:
Linked list,
Binary tree…
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
How dynamic arrays are created?
What is breadth first tree?
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
Is hashtable throw concurrentmodificationexception?
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
What is sequential search?
Which sorting does collections sort use?
How many types of data structures are there?
Difference between calloc and malloc ?
Will hashmap allow null keys?
Define a Deque?
Why linked list is required?
Why linked lists are better than arrays?
What are lists?
How do hash tables work?