Login/RegisterData Structures :: Hashing - Discussion
Home > Data Structures > Hashing > MCQs Questions Discussion
4 / 52
Choose the correct option.
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 :
Aless than 1
Bless than n.
Cless than m.
Dless than n/2.
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!
