What is hash-collision in Hashtable and how it is handled in Java?
Page 1 of 1
What is hash-collision in Hashtable and how it is handled in Java?
Two different keys with the same hash value is known as hash-collision. Two different entries will be kept in a single hash bucket to avoid the collision.
Similar topics
» What is the difference between HashMap and Hashtable?
» What are the steps to connect to the database in java?
» Why string objects are immutable in java?
» Why java uses the concept of string literal?
» How can we create immutable class in java ?
» What are the steps to connect to the database in java?
» Why string objects are immutable in java?
» Why java uses the concept of string literal?
» How can we create immutable class in java ?
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum