CS 361: About Test #1

Here is the breakdown of 39 the 40 grades in Test #2 (scores are over 100), along with a rough interpretation as letter grades:

A+:  above 90 (2 students)
A:   81 to  90 (1 student)
B+:  71 to  80 (3 students)
B-:  61 to  70 (4 students)
C+:  51 to  60 (9 students)
C-:  41 to  50 (10 students)
D+:  31 to  40 (3 students)
D-:  21 to  30 (2 students)
F:   below 21 (5 students)

There clearly was a fair amount of fatigue... Too many confusions between plain binary search trees (without any worst-case guarantees) and balanced binary search trees (with logarithmic-time worst-case guarantees on all operations), too many "easy" interpretations of the questions (just because a question did not explicitly state that logarithmic time was required did not mean that the requested "improvement" to the ADT should be allowed to force some operations to take linear time), and far too many three-line answers with vague words in lieu of an analysis. That the test was doable is attested by two perfect scores.