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 x is less than ...................

A. 1
B. 1/n
C. 1/m
D. n/m
Answer» B. 1/n


Discussion

No Comment Found