100%(8)8 out of 8 people found this document helpful
This preview shows page 1 out of 1 page.
Name: ___________________________USC ID: ______________________INF 551, Spring 2017Quiz 10: B+-Tree Index & External Sorting (10 points. 15 minutes)1.[4 points] Consider a B+-tree with an order of2as shown below. Note that this simplifieddrawing only shows the slots occupied with keys. Show the final B+-tree after inserting keys 10,11, 12 in this order, and then removing key 20.2.[6 points] Consider merge-sorting a file with1000blocks using10buffer pages. Assume block