📝 Question
#1440
If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :
✓
Correct Answer
A. Less than 1
💡
Explanation
Hashing is also a method of sorting key values in a database table in an efficient manner.
⌨️ Press
A
B
C
D
to select