Note 1

Take Note:

Take a note while surfing.





Note With Ink

Give your Note a Colorful Tag.




Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.





Think With Ink

Differ your Content by Color.




Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape





Note With Ink

Simple an Easy Way to take a note.




Easy to Access

Get the same in next visit.

Data Structures :: Hashing

Home > Data Structures > Hashing > General Questions

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 :

Answer: less than 1

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

2. 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: Double Hashing

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

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

Answer: Map

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!