Graph Data Structure Test – 1

1. Which hash function satisfies the condition of simple uniform hashing?

2. What is the advantage of the multiplication method?

3. Using division method, in a given hash table of size 157, the key of value 172 be placed at position ____

4. Which scheme uses a randomization approach?

5. What is the value of h(k) for the key 123456?
Given: p=14, s=2654435769, w=32

6. Collisions can be reduced by choosing a hash function randomly in a way that is independent of the keys that are actually to be stored.

7. How many steps are involved in creating a hash function using a multiplication method?

8. What is the average retrieval time when n keys hash to the same slot?

9. What is the hash function used in multiplication method?

10. A good hash approach is to derive the hash value that is expected to be dependent of any patterns that might exist in the data.