B+ tree 2

Question

Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?

Comments

Ashwin only confusion is that.. They want two level tree.. To index record pointers now if the records are included in two level then 50 would be right answer if records are excluded then 49*50 is right isn't??

---

To make 2 level binary tree we've to include records anyway at the 2nd level then record size is must.

---

@Ashwin Kulkarni

2450 a/c to me correct , I wanted to confirm :)

Answer 1

2450 is right