NIELIT SB_2018_60

Question

Identify the true statements from the given statements

(i) Number of child pointers in a B/B+ tree node is always equal to number of keys in it plus one

(ii) B/B+ tree is defined by a term minimum degree. And minimum degree depends on hard disk block size, key and address sizes.

(a) i

(b) ii

(c ) i and ii

(d) None of these

Comments

c?

---

both options are correct

---

CAN YOU PROVIDE QUESTION PAPER ???

---

@satbir , can’t minimum degree always be 1? I know maximum degree depends on block size but how minimum degree is also dependent on size of block?

Answer 1

Both statements are true.

1.# Child or block pointers = # Keys +1

2. B/B+ tree is defined by a term minimum degree. And the minimum degree depends on hard disk block size, key and address sizes.

this is true because order or degree of B/B+ tree depends on block size, value(key), record pointer size, and child pointer size.

(here, address size refers record and block(child) pointer size)