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

Options
- less than 1.
- less than n.
- less than m.
- less than n/2.

CORRECT ANSWER : less than 1.

Discussion Board
Data structures

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 :

Answer Explaination

Pavan kalyan 09-30-2019 05:56 AM

Data Structure - Hashing

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

Prajakta Pandit 02-1-2017 11:11 PM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲