COP 3530 – Homework Problems #2 – Summer 2002 Due: Wednesday June 24, 2002 at beginning of class – no late assignments! 1. Shown below is a B-Tree of order 6 at some point in time. Show the tree at each time instance after each “access” to the tree in the following “access sequence” occurs. Access sequence: (insert 4), (insert 30), (insert 24), (delete 18), (delete 24) 2. For the 2-4 tree shown below, shown the change to the tree that occurs when the key value 34 is inserted into this tree. Explain what happened to the tree when this insert occurred. 3. Shown on the next page is a Cartesian plane with several objects in the plane. (a) Produce the MBR for each object in the plane. (b) Assuming that the objects in the plane are inserted in alphabetic order, build an R-tree of degree 2 (binary) that properly models the spatial relationships that exist in this plane. 4. Using the pseudocode conventions for interconnection network models (mesh) of parallel processing that were presented in the class notes, develop a complete

This
preview
has intentionally blurred sections.
Sign up to view the full version.