Crack
GATE
C
G
Topic
Hashing
Algorithms
0
/ 2 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
0
0
0
0
2018
0
0
0
0
2019
0
0
0
0
2020
0
0
0
0
2021
0
0
0
0
2022
1
1
0
0
2023
1
1
0
0
2024
0
0
0
0
2025
0
0
0
0
2026
0
0
0
0
1
CS 2023 · 1 mark · MCQ · Moderate
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
k
k
be the number of keys,
m
m
m
be the number of slots in the hash table, and
k
>
m
k>m
k
>
m
.
2
CS 2022 · 1 mark · MCQ · Moderate
Suppose we are given
n
n
n
keys,
m
m
m
hash table slots, and two simple uniform hash functions
h
1
h_1
h
1
and
h
2
h_2
h
2
. Further suppose our hashing scheme uses
h
1
h_1
h
1
for the odd keys and
h
2
h_2
h
2
for the even keys. What is the expected number of keys in a slot?