# vitamin3.pdf - 9/19/2020 Submit Vitamin 3 | Gradescope 5/5...

• 8
• 100% (41) 41 out of 41 people found this document helpful

Course Hero uses AI to attempt to automatically extract content from documents to surface to you and others so you can study better, e.g., in search results, to enrich docs, and more. This preview shows page 1 - 4 out of 8 pages.

9/19/2020Submit Vitamin 3 | Gradescope5/5Questions AnsweredSaved at 5:49 PMVitamin 3Q1B+ Tree Insertion3 PointsQ1.1What is the height of the tree after the sequence of insertions 26, 27,28, 29, 30? For reference, the tree's current height is 2.EXPLANATIONAn inner node splits when 27 is inserted, and an inner node andthe root splits when 29 is inserted. Because the root only splitsonce, the height increases by 1.2345
1/8Q1.2
9/19/2020Submit Vitamin 3 | Gradescope2/8Considering the same B Tree from the question above (beforeinsertion), what is the maximum number of keys we can insert into thetree without changing the height? Hint: Look at the in-persondiscussion worksheet to figure out this question.13EXPLANATION13. At its maximum capacity, there will be 9 leaf nodes at thebottom, with 2 leaf entries each. This results in a total of 18 leafentries, and 5 of these leaf entries are currently filled. 18-13 = 5.Q1.3Using the same B Tree from the 1st question (before insertion), what isthe minimum number of keys we can insert to change the height of thetree? Hint: Look at the discussion worksheet to figure out this question.4EXPLANATION4 keys. A possible insertion pattern is 3, 4, 5, 6.CorrectSave AnswerLast saved onSep 19 at 5:49 PMQ2Bulk Loading2 PointsQ2.1Assume you bulk loaded the keys 1 to 60 into a B+ tree with fill-factor.75 and order d = 2. How many leaf nodes would there be?
3/8

Course Hero member to access this document