Hash Tree MCQ

Test your knowledge with important Hash Tree MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Hash Tree MCQs at Bissoy

• Hash tree is used in data synchronisation. In the worst case the data synchronisation takes ______ time.
  ক

  O(logn)

  খ

  O(n2)

  গ

  O(nlogn)

  ঘ

  O(n)
• Sequential access in a Hash tree is faster than in B-trees.
  ক

  True

  খ

  False
• What is the worst case time complexity of the insertion in the hash tree?
  ক

  O(logk(n))

  খ

  O(n2)

  গ

  O(nlogk(n))

  ঘ

  O(kn)
• Where is the hash tree used?
  ক

  in digital currency

  খ

  in sorting of large data

  গ

  for indexing in databases

  ঘ

  in encryption of data
• What will be the height of the hash tree with branching factor 2 and with 8 records?
  ক

  3

  খ

  5

  গ

  4

  ঘ

  6
• Hash tree is also known as _____
  ক

  Merkle tree

  খ

  T -tree

  গ

  Hash table

  ঘ

  Bx-tree
• Which of the following is true for a Hash tree?
  ক

  Hashing is used for sequential access

  খ

  Indexing is used for direct access

  গ

  Hash tree allows only sequential access

  ঘ

  Hashing is used for direct access
• Which of the following is a widely used form of the hash tree?
  ক

  B+ – tree

  খ

  T tree

  গ

  Tiger tree hash

  ঘ

  Htree
• Hash tree is used in effective data verification in distributed systems.
  ক

  True

  খ

  False
• Hash tree is generalization of ______
  ক

  Heap

  খ

  Hash list

  গ

  BST

  ঘ

  B – tree