In a double hashing scheme, and are the auxiliary hash functions. The size of the hash table is 11. The hash function for the probe in the open address table is . 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)
GATE CS 2025 (Forenoon) — Question 65
AlgorithmsSearching, Sorting, Hashing MechanismsNAT2 marksHard
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on Searching, Sorting, Hashing Mechanisms
- GATE CS 2026 (Forenoon) · Q24Consider a hash table P[0, 1, , 10] that is initially empty. The hash table is maintained using open addressing with linear probing. The ha…
- GATE CS 2026 (Afternoon) · Q30The 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…
- GATE CS 2026 (Afternoon) · Q38Consider an array A of integers of size n . The indices of A run from 1 to n . An algorithm is to be designed to check whether A satisfies…
- GATE CS 2025 (Forenoon) · Q33The pseudocode of a function fun( ) is given below: c fun(int A[0, ..., n - 1]) for i = 0 to n - 2 for j = 0 to n - i - 2 if (A[j] > A[j +…
- GATE CS 2025 (Afternoon) · Q20Consider an unordered list of N distinct integers. What is the minimum number of element comparisons required to find an integer in the lis…
- GATE CS 2025 (Afternoon) · Q41An array A of length n with distinct elements is said to be bitonic if there is an index 1 = i = n such that A[1..i] is sorted in the non-d…

