Final Exam

This exam is 1 hour and 50 minutes. It will be a mix of coding and theory questions as seen in the previous exams.

Topics Covered

The final exam is comprehensive and includes any and all material presented in class. You are encouraged to review all previous practice exams (including the newly released practice exam for graphs). However it can include material not seen on previous exams as well. This includes topics such as:

• Graphs
• Graph Representation
• Graph Traversal
• MST Algorithms (Prim’s algorithm and Kruskal’s algorithm)
• Shortest Path (Dijkstra’s algorithm and Floyd–Warshall algorithm)

It covers all material from all assignments in the course.

Points:160

Start: Thursday, December 07

End: Wednesday, December 13