UTpaper

Free mock tests & test series

Question 133Asked in DSSSB PGT Computer Science (Technical), 11 Jul 2021

Which of the following statement is false about a B-tree of order M?

  1. AThe root has at least two child nodes and at most M child nodes.
  2. BThe internal nodes except the root have at least ceil(M/2) child nodes.
  3. CLeaf nodes are not at the same level.
  4. DA node is full if it has (M − 1) keys.
Show answerHide answer

Correct answer: (C) Leaf nodes are not at the same level.

Explanation

In a B-tree all leaves are at the same level, so statement (C) is false. The others are standard B-tree properties.

From DSSSB PGT Computer Science PYQ (Technical), 11 Jul 2021

This is question 133 of DSSSB PGT Computer Science PYQ (Technical), 11 Jul 2021. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.