Hashing function - Example - Data Structure

Q.  If ' h ' is a hashing function and it is used to hash ' n ' keys into a table of size ' m '  where n <= m . What is the expected number of collisions involving a particular key ' x ' ?
- Published on 26 Aug 15

a. less than 1.
b. less than n.
c. less than m.
d. less than n / 2.

ANSWER: less than 1.

Related Content

➨ Post your comment / Share knowledge


Enter the code shown above:

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