CS140 -- Final Exam: Grading

May 10, 1999
Jim Plank
Directory: ~jplank/cs140/Tests/1999-Spring/final
This file: http://web.eecs.utk.edu/~jplank/plank/classes/cs140/Tests/1999-Spring/final/grading.html

Question 1:

.5 points each for a, d, e and f. 0.5 points each for b and c if you left them blank.

Question 2:

1.5 points each for a and e. 0.5 points off for each other answer.

Question 3:

3 points for c. One point off if you put anything else down. An additional 0.5 points were taken off for each of a, d and e.

Question 4:

3 points for answering 3. 1 point for answering 2.

Question 5:

4 points for getting the right answer. 2 points if you had a valid binary search tree with 64 at the root (and all the right elements). 1 point if you simply had a valid binary search tree with all the right elements. Zero otherwise.

Questions 6 and 7

4 points for getting the right answer. 2 points if you had a valid AVL tree with all the right elements. 1 point if you simply had a valid binary search tree with all the right elements. Zero otherwise.

Question 8:

3 points for c. One point off for each other answer.

Question 9:

2 points for b. 1 point for c. Minus one for each other answer.

Question 10:

2 points for d. 0.5 points each for c and b. Minus one for each other answer.

Question 11:

1 point each for a, e and f. A third of a point each for b, d, and d.

Question 12:

2 points for b. One point off for each other answer.

Question 13:

1 point each for a, e and f. One point off for each other answer.

Question 14:

This is 20 points total, divided into 8 points for structure, and 12 points for code. The structure points:

Allocating storage for the new node: 2 points
Initializing the new node: 2 points
Finding where the node goes: 2 points
Inserting it in the right place: 2 points

The code points:

Allocating storage for the new node: 1 point
Initializing the new node: 1 point
Finding where the node goes: 1 point
Inserting it in the right place: 1 point
Calling malloc correctly and in all cases: 1 point
Setting the key properly: 1 point
Setting the val properly: 1 point
Setting left and right to NULL: 1 point
Doing the initialization in all cases (left/right/root): 1 point
Dealing correctly with an empty tree: 1 point
Finding the parent node correctly: 2 point
Becoming the left child correctly: 1 point
Becoming the right child correctly: 1 point
Calling strcmp correctly: 1 point
General stuff: 1 point

Question 15:

4 points for b, 2 for d.

Question 16:

3 points for p.

Question 17:

3 points for q, 1 for b.

Question 18:

3 points for n, 1 for i or p.

Question 19:

3 points for i, 1 for q.