GATE CS 2025 (Forenoon) — Question 65

AlgorithmsSearching, Sorting, Hashing MechanismsNAT2 marksHard

In a double hashing scheme, \( h_1(k) = k \bmod 11 \) and \( h_2(k) = 1 + (k \bmod 7) \) are the auxiliary hash functions. The size \( m \) of the hash table is 11. The hash function for the \( i^{\text{th}} \) probe in the open address table is \( [h_1(k) + i \cdot h_2(k)] \bmod m \). The following keys are inserted in the given order: 63, 50, 25, 79, 67, 24. The slot at which key 24 gets stored is ________. (Answer in integer)
Practise the full 2025-FN 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