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
This question was posed to me in an interview for internship.
Asked question is from Hashing techniques topic in division Indexing and Hashing of Database Management
Select the correct answer from above options
Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience