Data Structures :: Hashing

Home > Data Structures > Hashing > General Questions

1 / 3

 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: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

2 / 3

 The hash function is
H1(k) = k % 50.
In the case of collision, the hash function used is
H(k) = (H1(k) + M x H2(k)) % 50
where H1(k) = k % 50 and H2(k) = k % 20.
M is initialized to 0 and is incremented by 1 each time a collision occurs.
This could be categorized under which of the following collision detection technic

Answer: Option D

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

3 / 3

 Which of these are core interfaces in the collection framework. Select the one correct answer.

Answer: Option D

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Virtusa