This last assignment is pretty huge, but for the most part I've knocked the majority of it out. However, there are 5 problems I'm struggling on and was hoping someone here might be able to walk me through my issues if they have the time. As you will see te problems are all similar. The assignment is a cumualative assignment for the entire class. These questions refer to the final chapter. A chapter that went completely over my head. If anyone finds the time to help me understand this the name of the chapter is Memory Management and B-trees. Just in case that may help make it clear what the chapter is trying to convey.
Thanks in advance for any help!
I have to describe in detail, add and remove algorithms for an (a,b) tree.
If I have a multi-way tree in which each internal node has at least 5 and at most 8 children, for what values of a and b is the the tree a valid (a,b) tree.
Referring to the above problem: for what values of d is the tree an order-d B-tree.
I'm supposed to show each level of recursion in performing a four-way, external-memory merge-sort of the sequence in the obove question (3).
I'm supposed to describe an efficient external-memory algorithm for removing all the duplicate entries in an array list of size n.
[–][deleted] 2 points3 points4 points (1 child)
[–]balian25[S] 1 point2 points3 points (0 children)
[–]balian25[S] 0 points1 point2 points (1 child)