data base 2

Question

Answer 1

is it 4?

Comments

can u explain ur answer

---

i also dont know wether my approch is correct or not. so please confirm first wether my approach correct or not or let me know too please.

there are 1250 records and blocking fctor is 3 so

no. of records = 1250/3 = 417

so there are 417 clocks which contain pointer to record and these block form leave nodes in b+ tree.

as order = 11

but we want maximum level so we can fill each bloack with minimum pointer which is ceil(11/2) = 6

level  1 ==> 417/6 = 69

level 2 ==> 69/6 = 11

level 3 ==> 11/6 = 1

level 4 (root ) == > 1

please someone correct if i am wrong i also want to know werher this approach is correct or not.

---

@arch yeah, your approach is correct. the answer should be 4 level only.

---

for more accuracy use ceil value and for b+ tree always follow bottom up or Bulk loading approach

---

what is bulk loading approach?