GATE | GATE CS 1997 | Question 56

Last Updated :
Discuss
Comments

What is the probability of a collision when hashing n keys into a hash table of size m, assuming that the hash function produces a uniform random distribution?

O(1/n)

O(n/m)

O(logn)

O(m/n)

This question is part of this quiz :

Top MCQs on Hash Data Strcuture with Answers,Probability,GATE CS 1997
Tags:
DSA Quiz
Aptitude
GATE
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy