Test 2 Problems - Algorithms Data Structure | CP SC 212, Exams of Algorithms and Programming

CPSC 212-1 Name: _____________________________

Test #2 July 21, 2004

Closed books. Closed Notes. Calculators OK. 105 points. 75 minutes. Weight of each

question in parentheses. Please use a pencil. If you need more space, use the back of the

sheet.

1. (10) Insert the following values into an initially empty AVL tree. Indicate the type of

rotations performed (“S” for single, “D” for double). The end should be the final tree:

5 8 9 10 21 16 7 4 23 19 17 25

2. (10) Your friend says that he can use an array, a[i], to represent a tree using the

i: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

a[i]: __ __ __ __ __ __ __ __ __ __ __ __ __ __ __ __ __ __ __ __ __ __

Tree: root: I

children of I: C J children of F: E G

children of C: B F children of L: K M

children of J: _ L children of E: D _

children of B: A _ children of G: _ H

3. (10) Insert the following values into a B-Tree with L=M=3 (i.e., max number of keys

in a leaf is 3, maximum num of keys in an interior node is 2). Then answer the questions

following.

4. (10) Insert the following values into a 17-element hash table using hash function:

h1(x) = x%17. Use quadratic probing to handle collisions.

5 0 29 34 51 67 17 1 13 22 52 35

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

___ ___ ___ ___ ___ ___ ___ ___ ___ ___ ___ ___ ___ ___ ___ ___ ___