1

GATE CSE 2015 Set 2

MCQ (Single Correct Answer)

+2

-0.6

Which one of the following hash functions on integers will distribute keys most uniformly over $$10$$ buckets numbered $$0$$ to $$9$$ for $$𝑖$$ ranging from $$0$$ to $$2020$$?

2

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

+2

-0.6

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 the first 3 insertions?

3

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

+2

-0.6

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, 15, 20, 33, 12, 17, 10. The maximum, minimum, and average chain lengths in the hash table, respectively, are

4

GATE CSE 2010

MCQ (Single Correct Answer)

+2

-0.6

A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown below
Which one of the following choices gives a possible order in which the key values could have been inserted in the table?

Questions Asked from Hashing (Marks 2)

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