1

GATE CSE 2023

MCQ (Single Correct Answer)

+1

-0.33

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 number of keys, $$m$$ be the number of slots in the hash table, and $$k > m$$. Which one of the following is the best hashing strategy to counteract the adversary?

2

GATE CSE 2022

MCQ (Single Correct Answer)

+1

-0.33

Suppose we are given n keys, m has 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 h_{2} for the even keys. What is the expected number of keys in a slot?

3

GATE CSE 2020

Numerical

+1

-0.33

Consider a double hashing scheme in which the primary hash function is

h

Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value k=90 is _______.

h

_{1}(k)=k mod 23, and the secondary hash function is h_{2}(k)=1+(k mod 19).Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value k=90 is _______.

Your input ____

4

GATE CSE 2015 Set 3

Numerical

+1

-0

Given a hash table $$𝑇$$ with $$25$$ slots that stores $$2000$$ elements, the load factor $$\alpha $$ for $$𝑇$$ is ____________ .

Your input ____

Questions Asked from Hashing (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude