GATE DA 2025 Set 1 — Question 18
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasyCollision HandlingLinked Lists & HashingProgramming, Data Structures & Algorithms
Programming, Data Structures & Algorithms → Linked Lists & Hashing → Collision Handling
Last updated
Question
Consider a hash table of size 10 with indices , with the hash functionwhere linear probing is used to handle collisions. The hash table is initially empty and then the following sequence of keys is inserted into the hash table: . The indices where the keys and are stored are, respectively
Correct answer
(D) 4 and 6
Solution
We insert the keys one by one using and linear probing for collisions.
1.Insert 1: . Index 3 is empty. Placed at 3.
Table: [_, _, _, 1, _, _, _, _, _, _]2.Insert 4: . Index 2 is empty. Placed at 2.
Table: [_, _, 4, 1, _, _, _, _, _, _]3.Insert 5: . Index 5 is empty. Placed at 5.
Table: [_, _, 4, 1, _, 5, _, _, _, _]4.Insert 6: . Index 8 is empty. Placed at 8.
Table: [_, _, 4, 1, _, 5, _, _, 6, _]5.Insert 14: . Index 2 is occupied (by 4).
- Probe 3: Occupied (by 1).
- Probe 4: Empty. Placed at 4.
[_, _, 4, 1, 14, 5, _, _, 6, _]6.Insert 15: . Index 5 is occupied (by 5).
- Probe 6: Empty. Placed at 6.
[_, _, 4, 1, 14, 5, 15, _, 6, _]Key 14 is at index 4. Key 15 is at index 6.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 DA 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 Linked Lists & Hashing
2026 Set 1 Q15Consider that the quick sort algorithm is used to sort an array of distinct randomly ordered…2026 Set 1 Q16Consider the given Python program. [code] Which of the following is the correct output of this…2026 Set 1 Q25You are given the following Pre-order and In-order traversals of a Binary Tree T with nodes E, F,…2026 Set 1 Q31Let A be a sorted array containing 1000 distinct integers. You perform a recursive binary search on…2026 Set 1 Q39A recursive function in Python is given. [code] Now, consider the following function call:…