Question

In a record embedded b tree containing a particular record set, leaf blocks holds 10 records when full, 5 records when half full and internal node blocks holds 100 subtree pointers when full and 50 when half full. What is the maximum number of records that this structure can contain if it has 3 levels of internal nodes plus 1 leaf node level?

1) 100,000
2) 1,000,000
3) 10,000,000
4) 100,000,000
5) 1,000,000,000

Answer 1

The maximum number of records that this structure can contain is 10,000,000.

Step-by-step explanation:

To calculate the maximum number of records that the structure can contain, we need to find out the maximum number of records that each level can hold and then sum them up.

1. Leaf blocks when full: 10 records
2. Leaf blocks when half full: 5 records
3. Internal node blocks when full: 100 subtree pointers
4. Internal node blocks when half full: 50 subtree pointers
5. Number of levels: 3 levels of internal nodes plus 1 leaf node level

Using these values, we can calculate the maximum number of records:

1. Maximum number of records at leaf node level: 10 records
2. Maximum number of records at the second level (internal nodes): 100 subtree pointers x 10 records = 1000 records
3. Maximum number of records at the third level (internal nodes): 100 subtree pointers x 1000 records = 100,000 records
4. Maximum number of records at the fourth level (leaf node): 100 subtree pointers x 100,000 records = 10,000,000 records

Therefore, the maximum number of records that this structure can contain is 10,000,000.