Hash Tables Chaining using Doubly Linked Lists MCQ

Test your knowledge with important Hash Tables Chaining using Doubly Linked Lists MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Hash Tables Chaining using Doubly Linked Lists MCQs at Bissoy

• Collision is caused due to the presence of two keys having the same value.
  ক

  True

  খ

  False
• Which of the following technique stores data in a separate entity in case of a collision?
  ক

  Open addressing

  খ

  Chaining using doubly linked list

  গ

  Linear probing

  ঘ

  Double hashing
• Which of the following technique stores data in the hash table itself in case of a collision?
  ক

  Open addressing

  খ

  Chaining using linked list

  গ

  Chaining using doubly linked list

  ঘ

  Chaining using binary tree
• What is the advantage of using a doubly linked list for chaining over singly linked list?
  ক

  it takes less memory

  খ

  it is easy to implement

  গ

  it makes the process of insertion and deletion faster

  ঘ

  it causes less collisions
• Hashing can be used to encrypt and decrypt digital signatures.
  ক

  true

  খ

  false
• What is the time complexity of delete function in the hash table using a doubly linked list?
  ক

  O(1)

  খ

  O(n)

  গ

  O(log n)

  ঘ

  O(n log n)
• What is the time complexity of search function in a hash table using a doubly linked list?
  ক

  O(1)

  খ

  O(n)

  গ

  O(log n)

  ঘ

  O(n log n)
• What is the time complexity of insert function in a hash table using a doubly linked list?
  ক

  O(1)

  খ

  O(n)

  গ

  O(log n)

  ঘ

  O(n log n)
• What is the use of a hash function?
  ক

  to calculate and return the index of corresponding data

  খ

  to store data

  গ

  to erase data

  ঘ

  to change data
• Which of the following is used in hash tables to determine the index of any input record?
  ক

  hash function

  খ

  hash linked list

  গ

  hash tree

  ঘ

  hash chaining