GATE CS 2025 Set 1 — Question 65
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+2 / -0MediumOpen AddressingHashingProgramming & Data Structures
Programming & Data Structures → Hashing → Open Addressing
Last updated
Question
In a double hashing scheme, and are the auxiliary hash functions. The size of the hash table is 11. The hash function for the -th 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)
Correct answer
10 to 11
Solution
To find the slot where key 24 is stored, we simulate the insertion of all keys in the specified order into a hash table of size (slots 0 to 10).Hash Functions:
- Probe function: for
1.Key 63: . Slot 8 is empty. 63 is stored at slot 8.
2.Key 50: . Slot 6 is empty. 50 is stored at slot 6.
3.Key 25: . Slot 3 is empty. 25 is stored at slot 3.
4.Key 79: . Slot 2 is empty. 79 is stored at slot 2.
5.Key 67: . Slot 1 is empty. 67 is stored at slot 1.
6.Key 24:
- For : . Slot 2 is already occupied by 79. Collision occurs.
- Calculate the step size: .
- For : . Slot 6 is already occupied by 50. Collision occurs.
- For : . Slot 10 is empty.
- 24 is stored at slot 10.
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Hashing
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…2026 Set 1 Q24Consider a hash table that is initially empty. The hash table is maintained…2026 Set 1 Q27Consider the following C statements: Which of the following options is/are correct? [figure]