1

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 :

Correct Answer: less than 1

Make the most of this question

This page focuses on one Database Management System (DBMS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Database Management System (DBMS) MCQ: 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 : | Extra Education