## CS302 Midterm Exam -- October 14, 2014

## Files

## Comments

A pretty standard exam, and by and large, I was pleased with
how well y'all did. This was a standard mix:
- Question 1: Running times.
- Question 2: Disjoint sets -- you did wonderfully on this as a class!
- Question 3: Sorting -- you all struggled with this.
- Question 4: Priority Queues -- implementation
- Question 5: Enumeration -- implementation.

The ranges of grades are below. I am not breaking up grades into "B+" or "A-".
Instead, I simply break them up into ABCD, and use those scores to calculate your
final scores. When I get the overall class scores, I will break up the B's into A-/B+/B,
and the C's into B-/C+/C.

- A+: 65 - 73
- A: 60 - 65
- B: 45 - 60
- C: 35 - 45
- D: 25 - 35
- F: 0 - 25

## Tukey Plots

This is a Tukey Plot, which has lines to the max and min, yellow box denoting
the 1st and 3rd quartiles, hash marks at the median, and dot at the mean.

In the answers and grading, there are histograms of scores for each question, and a grid of the answers given for Questions 1 and 3.