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
c) Quadratic probing
2. In a hash table of size 10, where is element 7 placed?
3. What should be the load factor for separate chaining hashing?
4. Which of the following operations are done in a hash table?
a) Insert only
b) Search only
c) Insert and search
Answer: Insert and search
5. Which of the following is identical to that of a separate chaining hash node?
a) Linked list
Answer: Linked list
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)
Answer: H(x)=x mod table size
7. What is the correct notation for a load factor?
8. In hash tables, how many traversal of links does a successful search require?
c) 1+ (⅄/2)
Answer: 1+ (⅄/2)
9. Which of the following is a disadvantage of using separate chaining using linked lists?
a) It requires many pointers
b) It requires linked lists
c) It uses array
d) It does not resolve collision
Answer: It requires many pointers
10. What is the worst case search time of a hashing using separate chaining algorithm?
a) O(N log N)