GATE DA 2024 Set 1 — Question 21
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33MediumHashing & Hash TablesLinked Lists & HashingProgramming, Data Structures & AlgorithmsCollision Handling
Programming, Data Structures & Algorithms → Linked Lists & Hashing → Collision Handling
Last updated
Question
Consider performing uniform hashing on an open address hash table with load factor , where elements are stored in the table with slots. The expected number of probes in an unsuccessful search is at most .Inserting an element in this hash table requires at most ______ probes, on average.
Correct answer
(B) (1)/(1-α)
Solution
In open addressing with uniform hashing, the process of inserting an element involves probing the hash table until an empty slot is found. This process is identical to an unsuccessful search, which continues probing until an empty slot is encountered (indicating the key is not in the table).Given that the expected number of probes in an unsuccessful search is at most , the expected number of probes required to insert an element is also at most .Therefore, the correct option is (B).
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:…