Q. 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 : (Solved)
1. less than 1
2. less than n
3. less than m
4. less than n/2
- a. less than 1