• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | CS 2022 | Question 16

Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h1 and h2. Further, suppose our hashing scheme uses h1 for the odd keys and h2 for the even keys. What is the expected number of keys in a slot? 

(A)

[Tex]\frac{n}{2m}[/Tex]

(B)

[Tex]\frac{n}{m}[/Tex]

(C)

[Tex]\frac{m}{n}[/Tex]

(D)

[Tex]\frac{2n}{m}[/Tex]

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments