Doubt doubt doubt

[parth_tyagi]

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 less than 1.

Can you explain this…???

[asaurabh_26 (logical coder)]

@parth_tyagi

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 less than 1.

this is universal hashing statement
remember this