GATE DA 2024 — Question 21

Programming, Data Structures and Algorithmsbasic data structures: stacks, queues, linked lists, trees, hash tablesMCQ1 mark · −1/3 if wrongMedium

Consider performing uniform hashing on an open address hash table with load factor \(\alpha = \frac{n}{m} < 1\), where \(n\) elements are stored in the table with \(m\) slots. The expected number of probes in an unsuccessful search is at most \(\frac{1}{1-\alpha}\). Inserting an element in this hash table requires at most ______ probes, on average.
  1. A
    \(\ln\left(\dfrac{1}{1-\alpha}\right)\)
  2. B
    \(\dfrac{1}{1-\alpha}\)
  3. C
    \(1 + \dfrac{\alpha}{2}\)
  4. D
    \(\dfrac{1}{1+\alpha}\)
Practise the full 2024 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 basic data structures: stacks, queues, linked lists, trees, hash tablesTimed, 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