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

We have the best collection of Hash Tables Chaining using Doubly Linked Lists MCQs and answer with FREE PDF. These Hash Tables Chaining using Doubly 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 Doubly Linked Lists MCQs

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

a) true

b) false

#### 5. What is the advantage of using a doubly linked list for chaining over singly linked list?

a) it takes less memory

b) it is easy to implement

c) it makes the process of insertion and deletion faster

d) it causes less collisions

Answer: it makes the process of insertion and deletion faster

#### 6. Which of the following technique stores data in the hash table itself in case of a collision?

c) Chaining using doubly linked list

d) Chaining using binary tree

#### 7. Which of the following technique stores data in a separate entity in case of a collision?

b) Chaining using doubly linked list

c) Linear probing

d) Double hashing

a) hash function

c) hash tree

d) hash chaining

#### 9. What is the advantage of a hash table as a data structure?

a) faster access of data

b) easy to implement

c) very efficient for less number of entries

d) exhibit good locality of reference

#### 10. What is the use of a hash function?

a) to calculate and return the index of corresponding data

b) to store data

c) to erase data

d) to change data

Answer: to calculate and return the index of corresponding data