Hashing Functions Quiz Online Practice Test

1. Which of the following schemes employs a randomization approach?

Division hashing

Multiplication hashing

Universal hashing

Open addressing

2. Which hash function meets the criteria for simple uniform hashing?

h(k) = lowerbound(km)

h(k)= upperbound(mk)

h(k)= lowerbound(k)

h(k)= upperbound(k)

3. A good hashing strategy should ensure that the hash value is unaffected by any underlying patterns in the data.

True

False

Only if the data is numeric

Only if the data is textual

4. Convert the character string "pt" into its integer representation using the appropriate radix notation.

14963

14392

12784

14452

5. Which hash function corresponds to the division method?

h(k) = k/m

h(k) = k mod m

h(k) = m/k

h(k) = m mod k

6. In the division method, what values can m take?

Any prime number

Any even number

2p – 1

7. Which hashing scheme offers optimal performance?

Open addressing

Universal hashing

Division method

Multiplication method

8. For a hash table of size 157 using the division method, where should a key with value 172 be placed?

9. How many steps are required to create a hash function using the multiplication method?

10. What hash function is employed in the multiplication method?

h(k) = floor( m(kA mod 1))

h(k) = ceil( m(kA mod 1))

h(k) = floor(kA mod m)

h(k) = ceil( kA mod m)

11. What is a key benefit of using the multiplication method for hashing?

Requires only two steps

Utilizes a constant multiplier

The choice of m is less critical

Involves straightforward multiplication

12. What is the table size for a multiplication-based hash function if p is 7?

128

127

13. Given p=14, s=2654435769, and w=32, what is h(k) for the key 123456?

123

456

14. When n keys hash to the same slot, what is the average retrieval time?

Theta(n)

Theta(n2)

Theta(nlog n)

Big-Oh(n2)

15. Selecting a hash function randomly and independently of the keys can help reduce collisions.

True

False

Only if the hash table is large

Only with separate chaining

Test Name:	Hashing Functions Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	15 / 15
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Hashing Functions MCQ Quiz Online Practice Test