GATE DA concept:hash-tables PYQs & Answers

Questions 1–3 of 3. Imported answers require independent review unless marked reviewed.

Consider a hash table of size 10 with indices

, with the hash function

where linear probing is used to handle collisions. The hash table is initially empty and 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

Your answerChoose one option.

2 and 5

2 and 6

4 and 5

4 and 6

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Match the items in Column 1 with the items in Column 2 in the following table:

Column 1: (p) First In First Out; (q) Lookup Operation; (r) Last In First Out.

Column 2: (i) Stacks; (ii) Queues; (iii) Hash Tables

Your answerChoose one option.

(p) – (ii), (q) – (iii), (r) – (i)

(p) – (ii), (q) – (i), (r) – (iii)

(p) – (i), (q) – (ii), (r) – (iii)

(p) – (i), (q) – (iii), (r) – (ii)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider performing uniform hashing on an open address hash table with load factor

, where

elements are stored in the table with

slots. The expected number of probes in unsuccessful search is at most

. Inserting an element in this hash table requires at most _____ probes, on average.

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

GATE DA concept:hash-tables PYQs

How to practice concept:hash-tables

Question 18

Question 16

Question 21