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

• Compression techniques can be used on the keys to reduce both space and time requirements in a B-tree.
  ক

  True

  খ

  False
• What is the best case height of a B-tree of order n and which has k keys?
  ক

  logn (k+1) – 1

  খ

  nk

  গ

  logk (n+1) – 1

  ঘ

  klogn
• 2-3-4 trees are B-trees of order 4. They are an isometric of _____ trees.
  ক

  AVL

  খ

  AA

  গ

  2-3

  ঘ

  Red-Black
• B-tree and AVL tree have the same worst case time complexity for insertion and deletion.
  ক

  True

  খ

  False
• Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
  ক

  14

  খ

  7

  গ

  11

  ঘ

  5
• A B-tree of order 4 and of height 3 will have a maximum of _______ keys.
  ক

  255

  খ

  63

  গ

  127

  ঘ

  188
• B-tree of order n is a order-n multiway tree in which each non-root node contains __________
  ক

  at most (n – 1)/2 keys

  খ

  exact (n – 1)/2 keys

  গ

  at least 2n keys

  ঘ

  at least (n – 1)/2 keys