GATE CS 2026 (Forenoon) — Question 24

AlgorithmsSearching, Sorting, Hashing MechanismsMSQ1 markMedium

Consider a hash table \( P[0, 1, \dots, 10] \) that is initially empty. The hash table is maintained using open addressing with linear probing. The hash function used is \( h(x) = (x + 7) \bmod 11 \). Consider the following sequence of insertions performed on \( P \): 1, 13, 22, 15, 11, 24 Which of the following positions in the hash table is/are empty after these insertions are performed?
  1. A
    0
  2. B
    10
  3. C
    2
  4. D
    1
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Searching, Sorting, Hashing MechanismsTimed, 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