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

Select an option to check

Key concept

Searching, Sorting and Hashing

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Searching, Sorting and Hashing

Across GATE CS exams, Searching, Sorting, and Hashing are tested with a strong emphasis on exact comparison/swap counts, worst/best-case edge cases (especially for Quicksort and simultaneous min-max finding), trace-based simulation (such as step-by-step hashing probes and merge passes), and asymptotic tradeoffs for specialized or composite data inputs. Questions range from conceptual 1-mark classification to rigorous 2-mark NATs requiring precise manual execution of collision resolution or optimal merge trees.

Full Searching, Sorting and Hashing guide →

More on Searching, Sorting and Hashing

All 27 questions on Searching, Sorting and Hashing →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Algorithms · Searching, Sorting and Hashing

Official IIT answer key · IIT Kharagpur · Audited Aug 2026

Take topic test

GATE CSE 2022 Q16 · MCQ · 1 mark

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

Select an option to check

Key concept

Searching, Sorting and Hashing

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Searching, Sorting and Hashing

Full Searching, Sorting and Hashing guide →

More on Searching, Sorting and Hashing

All 27 questions on Searching, Sorting and Hashing →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

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

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2022

More on Searching, Sorting and Hashing

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

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2022

More on Searching, Sorting and Hashing

Suppose we are given nnn keys, mmm hash table slots, and two simple uniform hash functions h1h_1h1​ and h2h_2h2​. Further suppose our hashing scheme uses h1h_1h1​ for the odd keys and h2h_2h2​ for the even keys. What is the expected number of keys in a slot?

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2022

More on Searching, Sorting and Hashing

Share this solution

Suppose we are given nnn keys, mmm hash table slots, and two simple uniform hash functions h1h_1h1​ and h2h_2h2​. Further suppose our hashing scheme uses h1h_1h1​ for the odd keys and h2h_2h2​ for the even keys. What is the expected number of keys in a slot?

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2022

More on Searching, Sorting and Hashing

Share this solution

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

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