hw2 - algorithm for searching for a specific key value in a...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
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
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: algorithm for searching for a specific key value in a list of key values (assume the key values are integers). Assume the key value on which the search is based is a front end variable as opposed to a distributed variable with an instantiation in each processor. 5. Using dynamic hashing show the contents of both the index structure and the data file buckets after each of the insert/delete operations shown below is completed. Assume that each data file bucket can hold only two key values and that the file is initially empty. (1) Insert: 01101 (2) Insert: 10111 (3) Insert: 00110 (4) Insert: 11001 (5) Insert: 11000 (6) Insert: 10011 (7) Delete: 01101 (8) Delete: 00110 (9) Insert: 00011 Homework #2 - 1 16 1 2 5 7 18 25 27 28 8 20 68 4 5 7 12 72 80 88 28 45 59 (10) Insert: 01010 (11) Insert: 00000 (12) Insert: 11100 Homework #2 - 2 G y x Cartesian plane for problem #3. Homework #2 - 3 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 A C D E F B...
View Full Document

Page1 / 3

hw2 - algorithm for searching for a specific key value in a...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online