GATE CS 2026 (Afternoon) — Question 30

AlgorithmsSearching, Sorting, Hashing MechanismsNAT1 markMedium

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)
Practise the full 2026-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Searching, Sorting, Hashing MechanismsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group