Skip to content
Related Articles

Related Articles

UGC-NET | UGC NET CS 2017 Jan – II | Question 24
  • Last Updated : 26 Mar, 2018
GeeksforGeeks - Summer Carnival Banner

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 _______.
(A) 1
(B) 1/n
(C) 1/m
(D) n/m


Answer: (A)

Explanation: Universal hashing states that:- 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.
So, option (A) is correct.

Quiz of this Question

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :