CSCI 264: Final exam
The final exam will take place on December 14, 2017, 5-7pm in room GOL-1445.
The final exam is semi-cumulative. This means that it will emphasize material from the last five weeks but you need
to know the main points of the earlier weeks: e.g., be familiar with asymptotic notation,
analyze the running time of a recursive algorithm, know how dynamic programming works, etc.
Topics to study:
- Graph algorithms (including BFS/DFS and their applications, minimum spanning tree algorithms, shortest paths algorithms, flow networks and their applications) - there will be about 3 problems related to graph algorithms
- P,NP,NP-complete - there will be about 1 problem on this topic (due to limited time devoted to NP and NP-completeness, about 1/2 of the problem will be about NP and NP-completeness,
the rest will be about P - we have studied the class P for essentially the entire semester)
- Something else - there will be about 1 problem on a topic covered earlier in the term
The final exam consists of 5 problems, each worth 10 points. I will drop the lowest-scored problem and the remaining four problems
contribute to the overall score.
The final is closed book, notes, laptops, cell-phones, etc. However, you might bring one letter-sized double-sided "cheat-sheet"
in your own handwriting. Additionally, you may bring your 2 midterm cheat-sheets.
Here is a collection of older practice problems. The practice problems do not indicate the
difficulty of the actual final, though I try to design both the practice problems and the actual final exam problems at about the same difficulty level
(of course, your judgment of difficulty level might be different than mine).
Here are the solutions of the practice problems.
I recommend you to solve the practice problems first and only after you are done, check the solutions.
A comment about the practice problems and their solutions: The DP problem happens to be a repeat of a practice problem for midterm 2...