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

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

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

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

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

**Answer: **O(1)

**4. Which of the following trait of a hash function is most desirable?**

a) it should cause less collisions

b) it should cause more collisions

c) it should occupy less space

d) it should be easy to implement

**Answer: **it should cause less collisions

**5. What is the advantage of using linked list over the doubly linked list for chaining?**

a) it takes less memory

b) it causes more collisions

c) it makes the process of insertion and deletion faster

d) it causes less collisions

**Answer: **it takes less memory

**6. What is the worst case time complexity of insert function in the hash table when the list head is used for chaining?**

a) O(1)

b) O(n log n)

c) O(log n)

d) O(n)

**Answer: **O(n)

**7. Which of the following technique is used for handling collisions in a hash table?**

a) Open addressing

b) Hashing

c) Searching

d) Hash function

**Answer: **Open addressing

**8. Which of the following is an advantage of open addressing over separate chaining?**

a) it is simpler to implement

b) table never gets full

c) it is less sensitive to hash function

d) it has better cache performance

**Answer: **it is simpler to implement

**9. Which of the following helps keys to be mapped into addresses?**

a) hash function

b) separate chaining

c) open addressing

d) chaining using a linked list

**Answer: **hash function

**10. What is the advantage of the hash table over a linked list?**

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