Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightB Trees

B Trees MCQs

chevron_left Back Page 1/1 chevron_right Next
  • 1. B Trees are generally
  • filter_dramaExplanation
    Answer is : D
    None.
  • 2. A B-tree of minimum degree t can maximum _____ pointers in a node.
  • filter_dramaExplanation
    Answer is : D
    None.
  • 3. Every internal node in a B-tree of minimum degree 2 can have
  • filter_dramaExplanation
    Answer is : B
    None.
  • 4. In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.
  • filter_dramaExplanation
    Answer is : C
    None.
  • 5. The order of a B-Tree with 2, 3, 4 or 5 children in every internal node is
  • filter_dramaExplanation
    Answer is : C
    None.
  • 6. The smallest number of key that will force a B-tree of order 3 to have a height 3 is
  • filter_dramaExplanation
    Answer is : B
    None.
  • 7. B+- trees are preferred to binary trees in databases because
  • filter_dramaExplanation
    Answer is : A
    None.
chevron_left Back Page 1/1 chevron_right Next
leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points