Register

B+ tree

237 views

1 Answer

0 votes
0 votes
It is a straight que.

n*blockpointersize + (n-1)*keysize <= blocksize

Ans : floor(32.5) = 32

32 is not there in option.

from options, (29 & 31) can be answer. maximum among them is 31.

so resultant answer is 31
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
SandeepKumar147 asked 1 day ago
24 views
B- tree in DBMS
User Avatar
0 votes
0 votes
0 answers
2
SandeepKumar147 asked 2 days ago
14 views
B tree dbms
User Avatar
0 votes
0 votes
1 answer
3
gauravkumawat asked Jun 13, 2023
948 views
Explain the properties of B-Tree Also Construct B+ tree with order P=4 10,5,30,40,20,17,90,45,93,60,20,50,29
please solve in paper formet Explain the properties of B-Tree Also Construct B+ tree with order P=410,5,30,40,20,17,90,45,93,60,20,50,29
User Avatar
0 votes
0 votes
0 answers
4
Sahil_Lather asked Jan 29, 2023
518 views
TestBook TestSeries question to find max child possible in B+ Tree
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys? A. 17 B. 19 C. 59 D. 57
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes whic...
User Avatar
Link Copied!