Math 211

Final Exam review

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

The final exam for this class will be Wednesday, December 17, at 4:00 PM and will be comprehensive.  In your review please look over previous exam reviews, previous exams,  assigned problems, definitions, and biographical essays. 

We have covered some additional material since the fourth hour exam:

• From 8.1, know terms and definitions and examples.
• From 8.2 know terms and definitions, the "handshaking theorem", and the special graphs.
• From 8.3, be able to work with adjacency matrices and be able to determine whether two graphs are isomorphic or not.
• From 8.4 be able to work with paths (including using paths to determine isomorphism)
• From 8.5 be able to work with Euler paths and circuits (including the necessary and sufficient conditions for a graph to have one) and Hamilton paths and circuits.  Be able to describe the TSP.
• From 8.6 be able to state and work with Dijkstra's algorithm
• I don't know how far we will get on trees on Wednesday.  Know the terms (leaf, root, siblings, etc.) from 9.1 and tree traversals from 9.3.
• Know (as always) the brief biographies in the reading (same sort of question as before).

Any questions?  Please ask!  - Bob