CPSC 212-302 Name: _____________________________
Test #1B February 9, 2005
Closed books. Closed Notes. Calculators OK. 85 points. 60 minutes. Weight of each
question in parentheses. Please use a pencil. For more space, use the back of the sheet.
1. (10) Consider the following section of pseudo-code:
int i = 8*N;
while(i>0) {
for (int j=0; j<i-1; j++)
M[i] += A[i]*B[j]; // statement #1
i -= 8;
} // while
Analyze the code and develop an equation that specifies the total number of
multiplications performed in statement #1. Your answer should be expressed in terms
of N. Show how you arrived at your answer.
2. Consider the following code:
for (int i=0; i<10; i++) {
int x = (i%2==0)?((i>5)?(i*10):(i*5)):((i>6)?(i+15):(i-13));
System.out.println(i + ": " + x);
} // i
(5) What is displayed by the code segment? | (5) Rewrite the assignment statement using
| if-then-else statements
|
3. (10) Insert the following values into an initially empty AVL tree ignoring duplicates.
Show when, how, and what type (Single or Double) of rotations are performed. Draw
a box around the final tree.
14 21 46 1 7 16 5 8 15 27 6 12 10 9
4. (4) Give the reverse postorder (RLN) _______________________________and the
reverse inorder (RNL) ________________________traversals of the following tree.
root: F (6) Convert the binary tree to a k-ary tree.
children of F: E _
children of E: A B
children of B: C Q
children of A: H K
children of Q: G _
children of H: I J
