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 \leq m$, the expected number of collisions involving a particular key $x$ is less than __________.
option is A
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
Ans: A
ref: https://gateoverflow.in/45237/hashing
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
64.3k questions
77.9k answers
244k comments
80.0k users