What Is Hash-collision In Hashtable? How Was It Handled In Java?

1.	What Is Hash-collision In Hashtable? How Was It Handled In Java?
Answer» In Hashtable , if two different KEYS have the same HASH value then it leads to hash -collision. A BUCKET of type LINKED LIST used to hold the different keys of same hash value. In Hashtable , if two different keys have the same hash value then it leads to hash -collision. A bucket of type linked list used to hold the different keys of same hash value.

Answer»

In Hashtable , if two different KEYS have the same HASH value then it leads to hash -collision. A BUCKET of type LINKED LIST used to hold the different keys of same hash value.

In Hashtable , if two different keys have the same hash value then it leads to hash -collision. A bucket of type linked list used to hold the different keys of same hash value.

Discussion

No Comment Found

Related InterviewSolutions

How Can We Restrict Inheritance For A Class?
Why Does Map Interface Not Extend The Collection Interface In The Java Collections Framework?
What Is The Difference Between Transient And Volatile Variable In Java?
Why We Used Vector Class?
What’s The Base Class Of All Exception Classes?
Which Api Is Provided By Java For Operations On A Set Of Objects?
How Can We Find The Actual Size Of An Object On The Heap?
Define An Enumeration?
Define Jaxp & Jaxb?
Explain Struts 1 Classes Are Not Thread Safe Whereas Struts 2 Classes Are Thread Safe?

What Is Hash-collision In Hashtable? How Was It Handled In Java?

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment