Hashing based on another type of data structure Hashing is implem.pdf
0 likes12 views
Hashing utilizes a data structure to map keys to values, requiring unique objects for unique hash codes. Collisions can occur when different hash codes point to the same position in a hash table. The document discusses solutions and options related to managing these collisions.
1 of 1
Download to read offline
More Related Content
More from anikkothari1 (20)
Ad
Recently uploaded (20)
Ad
Hashing based on another type of data structure Hashing is implem.pdf
- 1. Hashing based on another type of data structure : Hashing is implemented by using the datastructure, in this use a certain structure which can map keys to values. Unique object is required for unique hash code : Every unique hash code maintains unique object. Hash codes assign to same position in hash table : There are different hash codes which assign to same position in hash table. Collissions exist in a hash table : Since assigning different hash codes assign to same bucket may raise collission. Option 1, 2 and 3 are correct choice. Solution Hashing based on another type of data structure : Hashing is implemented by using the datastructure, in this use a certain structure which can map keys to values. Unique object is required for unique hash code : Every unique hash code maintains unique object. Hash codes assign to same position in hash table : There are different hash codes which assign to same position in hash table. Collissions exist in a hash table : Since assigning different hash codes assign to same bucket may raise collission. Option 1, 2 and 3 are correct choice.