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 :
A. less than 1
B. less than n
C. less than m
D. less than n/2
Answer:A
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 :
A. less than 1 B. less than n C. less than m D. less than n/2