Math 210

Final Exam eview

Caveat:  Although I try to be comprehensive in these exam reviews, please understand that you are responsible for the material covered since the last exam.  If you notice something that I have missed, please do let me know.

The final exam for this class will be Friday, Dec. 15, 12:00 noon - 2:00.  It will be a mandatory, two-hour, in class, comprehensive exam. Current University regulations require that all students take the final exam at this date and time.

In your review for the final, please review homework, earlier exams, and the earlier exam review documents.  In addition, we have covered some material not yet covered on an hour exam (but which may appear in the final exam):

• Euler and Hamilton Paths (define and find in a graph).
• Dijkstra's shortest path algorithm
• Breadth-first and depth-first search.
• Trees, including definitions
• Binary search trees
• Traversal of binary search trees
• Finite state automata and however far we get on Wednesday.
• There will probably be a small number of history questions.

Any questions?  Please ask!  - Bob