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 :

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

This question was posed to me in an interview for internship.

Asked question is from Hashing techniques topic in division Indexing and Hashing of Database Management

1 Answer

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 :

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

Related questions

Most popular tags