GATE CS 2020 (Forenoon) — Question 33

AlgorithmsSearching, Sorting, Hashing MechanismsNAT1 markMedium

Consider a double hashing scheme in which the primary hash function is \( h_1(k) = k \bmod 23 \) and the secondary hash function is \( h_2(k) = 1 + (k \bmod 19) \). Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value \( k = 90 \) is ________.
Practise the full 2020-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
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