Scribd
Upload
49 views2 pages

Some Extra Help: and Apology For Last Week's Tut

The document provides additional help and an apology for forgetting textbooks and other necessities for an online tutoring session during a long lockdown. It then provides the answers to 10 questions about B-trees, B*-trees, and prefix B+-trees, including definitions of order, height, fill requirements, and advantages.

Uploaded by

C-dawg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views2 pages

Some Extra Help: and Apology For Last Week's Tut

The document provides additional help and an apology for forgetting textbooks and other necessities for an online tutoring session during a long lockdown. It then provides the answers to 10 questions about B-trees, B*-trees, and prefix B+-trees, including definitions of order, height, fill requirements, and advantages.

Uploaded by

C-dawg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Some Extra Help

And apology for last week’s tut🙏

PLEASE NOT THE TEXTBOOK I USED WAS THE SECOND EDITION PDF VERSION DIDN’T HAVE
MY COPY FORGOT IT IN PTA SOZ. SIDE NOTE I PROBABLY SHOULD HAVE REMEMBERED TO
PACK THAT AS WELL AS OTHER NECESSETIES LIKE UNDERWEAR BUT ALAS THIS IS GONNA
BE A LONG LOCKDOWN 😪….SO UMM YEAH BUT NEVER MIND 👇

1.1 Why must the order M of a B-Tree be an odd number?


Cannot be even as when splits occur 1 sibling will always result in
underflow if keys are divided

1.2 Are B-Trees immune to the order in which keys are inserted?
No. If insertion is orderly it will result in a half-filled tree

1.3 Give 2 advantages that B*-trees have over B-Trees:


Splitting is delayed given on Chapter 7 Page 312
More utilization of space

1.4 What is the maximum height for a B-Tree with order M and X
number of keys?
LogM((X+1)/2)+1 = Answer equation given on Chapter 7 Page 304

1.5 Max number of leaf nodes in a B+-tree with order M and X number
of keys
X/((m-1)/2) = Answer
1.6 What is the fill requirement for a Bn-tree with n = X?
X+1/X+2 = Answer equation given on page 313 Chapter 7 after
fig 7.11

1.7 For a B-Tree of height H and order M what is the minimum number
of leaf nodes this tree should have?
2*(m/2)h-2 = Answer equation given on page 304 by removing (q-
1) from

1.8 Maximum number of keys that a B-tree of height H and order M?


MH-1 = Answer

1.9 Minimum number of keys that a B*-tree of height H and order M?


1+2*((((M-1)*2/3)H-1 -1) = Answer

1.10 Advantages of Prefix B+-tree?


Efficiency in search given on page 317 Chapter 7 after fig 7.15
Memory efficient

You might also like