The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function h(k) = k 9. The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is … (answer in integer)

Official answer: 3. Explanation: Compute the hash value h(k) = k 9 for each key: - h(5) = 5 9 = 5 - h(28) = 28 9 = 1 - h(19) = 19 9 = 1 - h(15) = 15 9 = 6 - h(26) = 26 9 = 8 - h(33) = 33 9 = 6 - h(12) = 12 9 = 3 - h(17) = 17 9 = 8 - h(10) = 10 9 = 1 Distribution of keys into the slots: - Slot 1: \28, 19, 10\ (Chain length = 3) - Slot 3: \12\ (Chain length = 1) - Slot 5: \5\ (Chain length = 1) - Slot 6: \15, 33\ (Chain length = 2) - Slot 8: \26, 17\ (Chain length = 2) The maximum number of keys hashed to any single slot is in slot 1, which contains 3 keys. Therefore, the length of the longest chain is 3.

Algorithms · Searching, Sorting and Hashing

Official IIT answer key · IIT Roorkee · Audited Aug 2026

Take topic test

GATE CSE 2026 Set 2 Q30 · NAT · 1 mark

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function $h(k) = k \bmod 9$ . The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is _______. (answer in integer)

Numerical answer

Enter a value 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 Roorkee · Audited Aug 2026

Take topic test

GATE CSE 2026 Set 2 Q30 · NAT · 1 mark

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function $h(k) = k \bmod 9$ . The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is _______. (answer in integer)

Numerical answer

Enter a value 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.

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function $h(k) = k \bmod 9$ . The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is _______. (answer in integer)

Step-by-step verified solution

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

More from GATE CSE 2026 Set 2

More on Searching, Sorting and Hashing

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function $h(k) = k \bmod 9$ . The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is _______. (answer in integer)

Step-by-step verified solution

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

More from GATE CSE 2026 Set 2

More on Searching, Sorting and Hashing

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function h(k)=k mod 9h(k) = k \bmod 9h(k)=kmod9. The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is _______. (answer in integer)

Step-by-step verified solution

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

More from GATE CSE 2026 Set 2

More on Searching, Sorting and Hashing

Share this solution

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function h(k)=k mod 9h(k) = k \bmod 9h(k)=kmod9. The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is _______. (answer in integer)

Step-by-step verified solution

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

More from GATE CSE 2026 Set 2

More on Searching, Sorting and Hashing

Share this solution

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function $h(k) = k \bmod 9$ . The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is _______. (answer in integer)

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function $h(k) = k \bmod 9$ . The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is _______. (answer in integer)