What Is Hash-collision In Hash Based Collections?

1.	What Is Hash-collision In Hash Based Collections?
Answer» In HashMap, using the KEY, a Hash is calculated and that hash VALUE decides in which bucket the particular Map.Entry object will RESIDE. Hash collision means more than ONE key having the same calculated hash value THUS stored in the same bucket. In HashMap, in that case Entry objects are stored as a linked-list with in the same bucket. In HashMap, using the key, a Hash is calculated and that hash value decides in which bucket the particular Map.Entry object will reside. Hash collision means more than one key having the same calculated hash value thus stored in the same bucket. In HashMap, in that case Entry objects are stored as a linked-list with in the same bucket.

Answer»

In HashMap, using the KEY, a Hash is calculated and that hash VALUE decides in which bucket the particular Map.Entry object will RESIDE.

Hash collision means more than ONE key having the same calculated hash value THUS stored in the same bucket. In HashMap, in that case Entry objects are stored as a linked-list with in the same bucket.

In HashMap, using the key, a Hash is calculated and that hash value decides in which bucket the particular Map.Entry object will reside.

Hash collision means more than one key having the same calculated hash value thus stored in the same bucket. In HashMap, in that case Entry objects are stored as a linked-list with in the same bucket.

Discussion

No Comment Found

Related InterviewSolutions

What Is Linkedhashset?
Which Set Implementation Should Be Used If You Want The Insertion Order To Be Maintained?
How Does Hashset Internally Works In Java?
Hashmap Vs Linkedhashmap Vs Treemap In Java?
Difference Between Hashmap And Hashtable In Java?
What Is A Identityhashmap?
What Is A Weakhashmap?
What Is Treemap In Java?
Which Map Implementation Should Be Used If You Want Map Values To Be Sorted By Keys?
What Is Linkedhashmap?