Dark Mode

0 votes

Answer is less than 1. Though it is not mentioned in the options tat r given. It is a scenario of Universal Hashing. Please kindly visit d link given below for more information.

http://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/chap12.htm

0 votes

**THIS IS THEOREM OF 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 xx is less than 1.

http://www.cs.nmsu.edu/~ipivkina/Spring08cs372/Cormen/chapter12HashTables.htm