Register

consider a B+ tree with order 15, what is the max no of records that can be indexed with 3 levels
closed

• closed by
245 views
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
5 answers
1
focus _GATE asked Oct 21, 2015
2,093 views
If the order of a B-Tree is 20 , then the number of levels needed to store 15 , 998 keys are?
If the order of a B-Tree is $20$, then the number of levels needed to store $15,998$ keys are ______.
User Avatar
0 votes
0 votes
2 answers
2
Neyoa asked May 19, 2022
2,995 views
Suppose an ISP owns the block of addresses of the form 131.210.16.0/21. Suppose it wants to create four subnets from this block, with each block having the same number of IP addresses. i. What are the prefixes (of form a.b.c.d/x) for the four subnets? ii. What is the number of host address that can be supported per subnet?
Suppose an ISP owns the block of addresses of the form 131.210.16.0/21. Suppose it wants to create four subnets from this block, with each block having the same number of...
User Avatar
0 votes
0 votes
0 answers
3
Akriti sood asked Jun 7, 2016
261 views
if w use 3 key pointers and 4 pointer node .How many diff B tree can be created with 6 records ?
does anyone has a detailed explanation for this as i have refered everywhere but could'nt get a satisfying answer?? TIA
does anyone has a detailed explanation for this as i have refered everywhere but could'nt get a satisfying answer?? TIA
User Avatar
Link Copied!