Please explain how the answer is 1

#1

Q4. Number Of Collision
If ‘h’ is the hashing function and is used to hash n keys into a table of size s, where n<=s, the expected number of collision involving a particular key X is

#2

@jatin_wadhwa,
This is a theorem in Universal Hashing -

“If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n<=m, the expected number of collisions involving a particular key x is less than 1.”

Reference: You can check the “Universal Hashing” section of the following link (for details):
https://www.cs.nmsu.edu/~ipivkina/Spring08cs372/Cormen/chapter12HashTables.htm

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.