Aspire Buzz #hashing

Question

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.

My thought:

If all the elements maps to same key then number of collisions would be less than n, am I wrong anywhere

Comments

is it c? because if all the keys map to the same value then the number of collisions will be less than m but I think it can be equal to n ...so that is why not less than n

---

No it was given as Option A

Answer 1

property of universal hashing function