Number of collisions should be less while placing the record in the hash table. Ideally no collision should occur. Such a function is called perfect hash function.
Properties of Good Hash Function
Rules
for choosing good hash function
1.
The hash function should be simple to compute.
2.
Number of collisions should be less while placing the record in the hash table.
Ideally no collision should occur. Such a function is called perfect hash
function.
3.
Hash function should produce such keys which will get distributed uniformly
over an array.
4.
The hash function should depend on every bit of the key. Thus the hash function
that simply extracts the portion of a key is not suitable.
Review Question
1. What are the characteristics of good hashing function?
C Programming and Data Structures: Unit IV: b. Hashing : Tag: : - Properties of Good Hash Function
C Programming and Data Structures
CS3353 3rd Semester EEE, ECE Dept | 2021 Regulation | 3rd Semester EEE Dept 2021 Regulation