Page 1 of 1
Question 5: B-Trees . 5 points Insert 29 into the B-tree below. For this B-tree you can assume the maximum degree (i.e.
Posted: Sat May 14, 2022 8:21 pm
by answerhappygod
- Question 5 B Trees 5 Points Insert 29 Into The B Tree Below For This B Tree You Can Assume The Maximum Degree I E 1 (119.25 KiB) Viewed 30 times
Question 5: B-Trees . 5 points Insert 29 into the B-tree below. For this B-tree you can assume the maximum degree (i.e. number of children per node) is 5. Redraw the tree after a split is performed. 10, 20, 23, 40 1, 5 15, 1921, 22 25, 27, 34, 3744, 50 Question 6: Hash Tables... .5 points Consider inserting the keys 22,9, 17, 23, 33 into a hash table of size m with the hash function h(k) = k mod m. For example if m= 5 then h(22) = 22 mod 5 = 22%5 = 2 Illustrate the result of inserting these keys using chaining (i.e. linked lists) to resolve collisions for the following hash table of size m = 5. Slot 0 Slot 1 Slot 2 Slot 3 Slot 4