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

**1. What is the time complexity of insert function in a hash table using a doubly linked list?**

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

**Answer: **O(1)

**2. What is the time complexity of search function in a hash table using a doubly linked list?**

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

**Answer: **O(1)

**3. What is the time complexity of delete function in the hash table using a doubly linked list?**

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

**Answer: **O(1)

**4. Hashing can be used to encrypt and decrypt digital signatures.**

a) true

b) false

**Answer: **true

**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?**

a) Open addressing

b) Chaining using linked list

c) Chaining using doubly linked list

d) Chaining using binary tree

**Answer: **Open addressing

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

a) Open addressing

b) Chaining using doubly linked list

c) Linear probing

d) Double hashing

**Answer: **Chaining using doubly linked list

**8. Which of the following is used in hash tables to determine the index of any input record?**

a) hash function

b) hash linked list

c) hash tree

d) hash chaining

**Answer: **hash function

**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

**Answer: **faster access of data

**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