Midterm 1

Midterm 1 will be held in our normal classroom ECSS 2.203 from 1:00pm–2:15pm on Thursday, March 9th.

The exam will be closed notes and closed book. It will cover everything we discussed through the release of Homework 2, including algorithm analysis, solving running time recurrences, divide-and-conquer algorithms, and dynamic programming algorithms. Dynamic programming on trees will not appear.

If you would like to see the kinds of problems that typically appear in Kyle's 6363 (and 4349) exams, feel free to visit his collection of past semester's websites. Nearly every exam or homework assignment given in one of his classes should be available.

On Tuesday, March 7th, Kyle will hold an in-class review session. It will also be recorded as usual. The session will be student-led, so please come prepared with any questions you have about class material, homework problems, problems from the texts, problems from past exams, etc.