A

Admin • 833K Points
Coach

Q. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :

  • (A) less than 1
  • (B) less than n
  • (C) less than m
  • (D) less than n/2

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.