OOP-10 BTree & B+Tree Individual Assignment 15 Points

Transcription

1 OOP-10-B+Tree-HW CSCI 2320 Initials P a g e 1 If this lab is an Individual assignment, you must do all coded programs on your own. You may ask others for help on the language syntax, but you must organize and present your own logical solution to the problem. No lab is complete until the MyClass submits the signed pledge form associated with that lab. I realize that no coded programs will be graded until I turn in the sign & pledge form associated with that program; any late penalties will continue to compound until the pledge form is submitted. If this lab is a team assignment, both team members may share logic as they program side by side on their own computers. Each person must type all of his/her own code as part of the learning process. Team assignments are never to be "You do this portion and I ll do that portion" or "You do this lab and I ll do the next lab". Some of the lab assignments will have short answer questions. These short answer questions will be spot checked and graded for completion, but not checked for accuracy. Once these labs are graded and returned, I encourage you to compare answers with another class member who has also had the lab graded and returned. These short answer questions will be spot checked and graded for completion, but not checked for accuracy. I encourage you to form a study group; get together to prepare for exams. Once your homework and labs are graded and returned, I encourage you to compare answers others in your study group who have also had the lab, or homework, graded and returned. You may not share this work outside the class; it is a violation of academic integrity to share your work with others outside the class. It is a violation of academic integrity to receive the software engineering work completed by other students. You must answer at least 90% of the short answer questions correctly! I/We realize that the penalty for turning in work that is not my own, or assisting others in doing so, can range from an "F" in the class to dismissal from Trinity University. I/We realize that the penalty for turning in work that is not my own, or assisting others in doing so, can range from an "F" in the class to dismissal from Trinity University. I realize that it is a violation of academic integrity to share any portion of this lab with any person (outside my 2320 team & professor)! Print Name Time Required =. Hrs. Signature (pledged) OOP-10 BTree & B+Tree Individual Assignment 15 Points General Information 1] {T/F} There Are a Number of Ways to Implement B+ Trees? 2] {T/F} The Rotations on a B Tree are different than the Rotations on a B+ Trees? 3] {T/F} The node structures on a B Tree are identical to the node structures on a B+ Tree. 4] B+ Trees are also called _?_ -Way Trees. 5] B M The B Tree was first described in a paper, called Organization and Maintenance of Large Ordered Indices, that was written in 1972 by Rudolf _?_ & Edward _?_ 6]?_ Form The Foundation For Most Of Today s Major Relational Databases.

2 OOP-10-B+Tree-HW CSCI 2320 Initials P a g e 2 B Tree Assume M = 7 sizeof(infotype) = 7,996 Bytes sizeof(key) = 8 Bytes sizeof(buffer) = 163,840 Show All Calculations! 7] This B Tree node has the capacity to hold _?_ records?. 8] {T/F} The records in the B Tree node will be sorted in ascending order. 9] This B Tree node will contain _?_ Pointers (to other B Tree Nodes)? 10] This B Tree node will contain _?_ Actual Number Of Records Counter 11] A B Tree node will contain _?_ records? (Express in terms of M). 12] A B Tree node will contain _?_ Pointers (Express in terms of M)? 13-15] In the space below, sketch a B Tree Node. Hint Include records, ptrs, counters ] The size of this B Tree Node = _?_ Bytes 18] The Max Records for Level 1 is _?_. 19] The Max Records for Level 2 is _?_. 20] The Max Records for Level 3 is _?_. 21] The Max Records for Level 4 is _?_ ] Every Node of A B Tree, except the root is at least _?_ full.

3 OOP-10-B+Tree-HW CSCI 2320 Initials P a g e 3 B+ Tree Assume M = 7 sizeof(infotype) = 7,996 Bytes sizeof(key) = 8 Bytes sizeof(buffer) = 163,840 Show All Calculations! 24] This B+ Tree node has the capacity to hold _?_ KeySets?. 25] {T/F} The records in the B+Tree node will be sorted in ascending order. 26] This B+Tree node will contain _?_ Pointers (to other B+Tree Nodes)? 27] This B+Tree node will contain _?_ Actual Number Of KeySets Counter 28] A B+Tree node will contain _?_ KeySets? (Express in terms of M). 29] A B+Tree node will contain _?_ Pointers (Express in terms of M)? 30-32] In the space below, sketch a B+Tree Node. Hint Include keysets, ptrs, counters ] The size of this B+Tree Node = _?_ Bytes 35] The Max KeySets for Level 1 is _?_. 36] The Max KeySets for Level 2 is _?_. 37] The Max KeySets for Level 3 is _?_. 38] The Max KeySets for Level 4 is _?_ ] Every Node of A B+Tree, except the root is at least _?_ full.

4 OOP-10-B+Tree-HW CSCI 2320 Initials P a g e 4 Buffering Scenario Assume M = 7 sizeof(infotype) = 7,996 Bytes sizeof(key) = 8 Bytes sizeof(buffer) = 163, ] What would be the B Tree optimal M for the specified buffer? SHOW YOUR WORK! A] Based on the B Tree Optimal M above, the Max KeySets for Level 1 is _?_. B] Based on the B Tree Optimal M above, the Max KeySets for Level 2 is _?_. C] Based on the B Tree Optimal M above, the Max KeySets for Level 3 is _?_. D] Based on the B Tree Optimal M above, the Max KeySets for Level 4 is _?_ ] What would be the B+ Tree optimal M for the specified buffer? SHOW YOUR WORK! A] Based on the B+ Tree Optimal M above, the Max KeySets for Level 1 is _?_. B] Based on the B+ Tree Optimal M above, the Max KeySets for Level 2 is _?_. C] Based on the B+ Tree Optimal M above, the Max KeySets for Level 3 is _?_. D] Based on the B+ Tree Optimal M above, the Max KeySets for Level 4 is _?_.

5 OOP-10-B+Tree-HW CSCI 2320 Initials P a g e 5 Thought Questions 61] {T/F} An Direct Access AVL Tree is almost always a better solution for an application than a Direct Access Binary Tree. [T] 62] {T/F} An Direct Access B+ Tree is always a better solution for an application than a Direct AVL Tree. [Hint: False!] 63-65] When would it be more appropriate to to use an AVL Tree as opposed to a B+ Tree? 66-68] When would it be more appropriate to to use an B+ Tree as opposed to an AVL Tree? 69] Put The Following In Order From Fastest To Longest With Respect To Code & Testing Time; assume each of the solutions are New Direct Access Coding From Scratch {Use the abbreviations!} AVL Tree [AVL], B Tree[B-T], B+ Tree [B+T], Double Linked List [DLL], Binary Tree [BT] 70] Assume that an application has 1,000,000 records and that each record is 5,000 bytes in size. The Key is 4 bytes. Does a B Tree or B+ Tree waste the most space? Explain your answer.

6 OOP-10-B+Tree-HW CSCI 2320 Initials P a g e 6 Sketching Trees 71-75] Sketch the AVL Tree inserting the following data in this order 100, 200, 300, 400, 500, 600, 700, 800, 900, 50, 150, 250, 350, 450, 550, 650, 750

7 OOP-10-B+Tree-HW CSCI 2320 Initials P a g e ] Sketch the B+ Tree inserting the following data in this order M = 5 100, 200, 300, 400, 500, 600, 700, 800, 900, 50, 150, 250, 350, 450, 550, 650, 750

8 OOP-10-B+Tree-HW CSCI 2320 Initials P a g e ] Sketch the B+ Tree inserting the following data in this order M = 7 100, 200, 300, 400, 500, 600, 700, 800, 900, 50, 150, 250, 350, 450, 550, 650, 750, 125, 175, 225, 275, 325, 375, 425, 475, 525, 575, 625, 675, 725, 775, 825, 875, 925, 975