Exams

There will be a total of 3 required midterms in this course. Each midterm has a particular focus on the most recent material, but because this course's material builds upon itself all topics covered are fair game.

Make sure to set calendar events for the dates below. It is up to you to make sure that you are available at the above dates for the exams. We will absolutely do our best to be flexible for students who give us plenty of warning that they won't be able to attend the dates listed, but will be less forgiving to a student who doesn't show up to an exam without warning.

For each exam, you will not be permitted any studying materials except a single 8.5"x11" page of notes which may contain whatever you like on it.

Exam Number Exam Location Exam Topics' Focus Exam Date / Time
1 Olin 001
  • All lecture material from lectures up to Friday March 7 until we begin discussing Insertion Sort (in the slides, you'll see a distinct slide alerting you to the end of the material for exam 1)
  • All worksheets so far, up to and including worksheet 3 (on Linked Lists)
  • All projects so far, up to and including project 3
 Thursday March 13 6:30 PM - 9:30 PM
2 Lovejoy 100
  • Everything that has been covered in class since the last exam's material ended (Mar. 7th) up to but not including hashing.
  • All worksheets up to and including worksheet 6.
  • All projects so far, up to and including the first half of project 6,
    namely the BST part of project 6.

(While this midterm isn't exactly "cumulative," material on the first midterm still matters--e.g., you can't just forget how ArrayLists work.)

Thursday April 17 6:30 PM - 9:30 PM
3 Olin 001
  • All lectures, worksheets, and projects, with a focus on material that has been covered in class since the last exam's material ended (April 9th).
 Thursday. May 8 6:30 PM - 9:30 PM