NIELIT 2018-34

Question

Identify the true statement from the given statements:

1. Number of child pointers in a B/B+ tree node is always equal to number of keys in it plus one
2. B/B+ tree is defined by a term minimum degree. And minimum degree depends on hard disk block size, key and address size

 

• A. (1)
• B. (1) and (2)
• C. (2)
• D. None of these

Answer 1

An internal node x containing 'n' keys has 'n+1' children.

Minimum degree depends on BLOCK SIZE, SEARCH KEY FIELD SIZE, BLOCK/RECORD POINTER.

 

REFER:- http://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/chap19.htm

Comments

How minimum degree ?? Shouldn’t it be maximum degree ?? There r lot of GATE questions which has asked maximum degree possible for given block size

---

Minimum or maximum, how is block size related to the degree?

Answer 2

The above two statements are true.

Answer- B. (1) and (2)