GATE DA 2025 — Question 18

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

Consider a hash table of size 10 with indices \(\{0, 1, \ldots, 9\}\), with the hash function
\[h(x) = 3x \pmod{10},\]
where 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: 1, 4, 5, 6, 14, 15. The indices where the keys 14 and 15 are stored are, respectively
  1. A
    2 and 5
  2. B
    2 and 6
  3. C
    4 and 5
  4. D
    4 and 6
Practise the full 2025 paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
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