# 50+ Hash Tables Chaining using Linked Lists MCQs with FREE PDF

We have the best collection of Hash Tables Chaining using Linked Lists MCQs and answer with FREE PDF. These Hash Tables Chaining using Linked Lists MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Hash Tables Chaining using Linked Lists MCQs

#### 1. Which of the following is not a collision resolution technique?

a) Separate chaining

b) Linear probing

d) Hashing

a) 6

b) 7

c) 17

d) 16

a) 0.5

b) 1

c) 1.5

d) 2

#### 4. Which of the following operations are done in a hash table?

a) Insert only

b) Search only

c) Insert and search

d) Replace

b) Array

c) Stack

d) Queue

#### 6. Which of the following is the hashing function for separate chaining?

a) H(x)=(hash(x)+f(i)) mod table size

b) H(x)=hash(x)+i2 mod table size

c) H(x)=x mod table size

d) H(x)=x mod (table size * 2)

a) Ω

b) ∞

c) ∑

d) ⅄

a) 1+⅄

b) 1+⅄2

c) 1+ (⅄/2)

d) ⅄3

#### 9. Which of the following is a disadvantage of using separate chaining using linked lists?

a) It requires many pointers

c) It uses array

d) It does not resolve collision

a) O(N log N)

b) O(N)

c) O(N2)

d) O(N3)