info@avatto.com
+91-9920808017
0. Let h be a hash chosen uniformly at random from a universal set H of hash functions. Suppose hashing n keys into m slots in table T. Then for a given key x, E(Number of collision with x) (Where E(x) denotes the expectation of X).
>(n/m)
= (n/m)
<(n/m)
<(m/n)
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.