1.

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 K is

A. less than 1
B. less than /g n
C. greater than 1
D. greater than /g n
Answer» B. less than /g n


Discussion

No Comment Found