Hash Tables and Collision Resolution: GATE CS previous year questions (Data Structures)

GATE CS 2026 Set 1MSQ1 markEasy (estimate)
GATE CS 2026 Set 1, Q.24
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…
Hash Tables and Collision Resolution
GATE CS 2026 Set 2NAT1 markEasy (estimate)
GATE CS 2026 Set 2, Q.30
The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function $h (k) = k mod 9$ . The collisions are resolved by chaining. After all the keys...
Hash Tables and Collision Resolution
GATE CS 2025 Set 1NAT2 marksMedium (estimate)
GATE CS 2025 Set 1, Q.65
In a double hashing scheme, $h_{1} (k) = k mod 11$ and $h_{2} (k) = 1 + (k mod 7)$ are the auxiliary hash functions. The size $m$ of the hash table is $11$ . The hash function for...
Hash Tables and Collision Resolution
GATE CS 2023MCQ1 markEasy (estimate)
GATE CS 2023, Q.20
An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let $k$ be the numbe...
Hash Tables and Collision Resolution
GATE CS 2022MCQ1 markEasy (estimate)
GATE CS 2022, Q.16
Suppose we are given $n$ keys, $m$ hash table slots, and two simple uniform hash functions $h_{1}$ and $h_{2}$ . Further suppose our hashing scheme uses $h_{1}$ for the odd keys and…
Hash Tables and Collision Resolution
GATE CS 2020NAT1 markEasy (estimate)
GATE CS 2020, Q.33 (CS Q.23)
Consider a double hashing scheme in which the primary hash function is $h_{1} (k) = k mod 23$ , and the secondary hash function is $h_{2} (k) = 1 + (k mod 19)$ . Assume that the tab...
Hash Tables and Collision Resolution
GATE CS 2015 Set 2MCQ2 marksMedium (estimate)
GATE CS 2015 Set 2, Q.43 (CS Q.33)
Which one of the following hash functions on integers will distribute keys most uniformly over 10 buckets numbered 0 to 9 for $i$ ranging from 0 to 2020?
Hash Tables and Collision Resolution
GATE CS 2015 Set 3NAT1 markEasy (estimate)
GATE CS 2015 Set 3, Q.27 (CS Q.17)
Given a hash table $T$ with 25 slots that stores 2000 elements, the load factor $α$ for $T$ is _____.
Hash Tables and Collision Resolution
GATE CS 2014 Set 1MCQ2 marksEasy (estimate)
GATE CS 2014 Set 1, Q.50 (CS Q.40)
Consider a hash table with 9 slots. The hash function is $h (k) = k mod 9$ . The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19,...
Hash Tables and Collision Resolution
GATE CS 2014 Set 3MCQ2 marksEasy (estimate)
GATE CS 2014 Set 3, Q.50 (CS Q.40)
Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots are unfilled after...
Hash Tables and Collision Resolution

Questions

Other topics of Data Structures