B+ Tree MCQ

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

• Which one of the following data structures are preferred in database-system implementation?
  ক

  AVL tree

  খ

  B-tree

  গ

  B+ -tree

  ঘ

  Splay tree
• What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?
  ক

  3

  খ

  80

  গ

  27

  ঘ

  26
• Efficiency of finding the next record in B+ tree is ____
  ক

  O(n)

  খ

  O(log n)

  গ

  O(nlog n)

  ঘ

  O(1)
• Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node. Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.
  ক

  Statement 1 is true but statement 2 is false

  খ

  Statement 2 is true but statement 1 is false

  গ

  Both the statements are true

  ঘ

  Both the statements are false
• A B+ tree can contain a maximum of 7 pointers in a node. What is the minimum number of keys in leaves?
  ক

  6

  খ

  3

  গ

  4

  ঘ

  7
• In a B+ tree, both the internal nodes and the leaves have keys.
  ক

  True

  খ

  False