Question 4. (20 point, 10 points each) Consider the B+ tree index of order d 2...
Consider the B+ tree shown in the following as an original tree. 73 85 1 2 5 6 8 1 32 39 41 45 52 58 73 91 99 Answer the following questions: 1) (2 marks) There are currently 18 records in this tree. How many additional records could be added to this tree without changing its height (give the maximum possible number)? (3 marks) Show the B+ tree after inserting a data entry with key 3 into the original...
Question 3. (25 points) Consider the B+ tree index shown below. Each intermediate node can hold up to five pointers and four key values. Each leaf can hold up to four records, and leaf nodes are doubly linked as usual, although these links are not shown in the figure. If you can borrow from or merge with both siblings, choose the right sibling. Answer the following questions 3080 I1 35425065 9098 12 68 69 70 79 98 99 1001105 30...
1. Consider the B+ tree index. Every node can contain m entries, where 2s ms4 The root node is an exception: it allows 1 m s4. B+ tree 18 15 17 A. Show the B+ tree that would result from inserting data entries with key 31, 32, and 41 into the tree. B. Given the output of (A), show the B+ tree that would result from deleting the data entry with key 3 C. Given the output of (B), show...
Problems #3 thru #5 refer to the following b-tree. Note that problems #4 and #5 are continuations of their previous problems. Original for 60 #3-5: 20,40 70 90 62 65 75 80 92 95 97 5 10 15 25 30 45 50 55 #3 Show the b-tree resulting by deleting 90. #4 Continuing from #3, show the b-tree resulting by deleting 25. Only attempt to borrow from an adjacent sibling. If possible, use the sibling that is immediately to its...
Build a splay tree inserting keys: 2, 13, 17, 4, 7, 19, 5, 8, 22, 6, 10. Show each step! a. Show the result of accessing keys 5, 8, 7 in order in the splay tree. Show the tree after each access. b. Show the result of deleting keys 10, 8, 7 in the splay tree. Start with the original tree and show the tree after each deletion.
[Index structure: B+ tree and B tree] (b). B+ tree index structure is said to be an improvement of B tree index structure. The most important distinction between them is that data record pointers exist in both internal and leaf nodes (i.e., blocks) for a B tree whereas only in the leaf nodes for a B+ tree. Explain why this distinction would make B+ tree a more efficient structure (in terms of index search speed) overall than a B tree...
QUESTION 9 Consider the following binary search tree: If the root node, 50, is deleted, which node will become the new root? A 15 B 24 C 37 D 62 QUESTION 10 In the following trees EXCEPT______, the left and right subtrees of any node have heights that differ by at most 1. A complete trees B perfect full trees C balanced binary trees D binary search trees QUESTION 11 A perfect full binary tree whose height is 5 has...
Suppose a binary tree data (in tiny written size) is stored in an array (A) as given below and root is placed at “0”index. Note the array indices are in larger written size (0 to 74). Show the traversal data of the given tree for a) In-Order Traversal b) Post Order Traversal A 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 3 28 13 36 15 9 22 44 7 10 75 33 19 15...
Question 4. Consider the B+ tree shown below (also shown in one of the lecture slides), show the resulting B+ tree index for the following operations (40 points) B+ Tree Before Inserting 8* After Inserting 8* Root ZÍ DET I 10 15 20 221 20271205-3* 3| a. When an additional record with key value = 37 is inserted into the file (after the insert of a record with key value =8 has been completed). b. when an additional record with...
5. Hashing (a) Consider a hash table with separate chaining of size M = 5 and the hash function h(x) = x mod 5. i. (1) Pick 8 random numbers in the range of 10 to 99 and write the numbers in the picked sequence. Marks will only be given for proper random numbers (e.g., 11, 12, 13, 14 ... or 10, 20, 30, 40, .. are not acceptable random sequences). ii. (2) Draw a sketch of the hash table...