CSCI 264: Midterm 2
The midterm will take place on Thursday, November 9, in class.
The midterm will cover material from week 6 until week 10. The specific topics are:
There will be at least one problem on greedy algorithms and at least two on DP.
You are expected to know the material from the first five weeks as it relates to the material covered
in weeks 6-10 (for example, I will likely ask you to estimate the running time of your or a provided algorithm, etc.).
- Greedy algorithms covered in class and on the homework
- Dynamic programming algorithms covered in class and on the homework
- Possibly also introduction to graph algorithms: BFS, DFS, and their applications (depending on how far we get on Thursday of week 10)
The midterm consists of 4 problems, each worth 10 points. I will drop the lowest-scored problem and the remaining three problems
contribute to the overall score.
The midterm is closed book, notes, laptops, cell-phones, etc. However, you may bring one letter-sized "cheat-sheet"
in your own handwriting (no printouts or photocopies), plus the cheat-sheet you used for Midterm 1 (if you did not get yours back, stop by my office).
Here is a set of algorithmic practice problems (please ignore the course number, the collection is taken from several courses).
I recommend to solve the problems first before reading
the solutions (thanks to Prof. Deever for writing some of them).
Disclaimer: The practice midterm does not indicate the difficulty of the actual midterm.