1,938 views
1 votes
1 votes

Suppose the search key of a B tree is V=8 byte long, the disk block size is B=512 bytes, a record(data) pointer is P=6 bytes and a block pointer is l=5 bytes. Calculate the order of the B tree and also  is each node of B tree is 69 percent full. Find the average number of keys per node of the above B tree.

  • 1. 

    29,17

    img

  • 2. 

    27,17

    img

  • 3. 

    28,18

    img

  • 4. 

    27,18

my answer is d) option is it plzz check 

1 Answer

0 votes
0 votes
order of the node is 27 and keys should be 17

Related questions

1 votes
1 votes
1 answer
2
Na462 asked Jun 29, 2018
609 views
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
0 votes
0 votes
0 answers
3
0 votes
0 votes
3 answers
4
Na462 asked Feb 2, 2019
2,043 views