ARCHIVE PAGE

Instructor: Gábor Hetyei

Important information:

• Course syllabus
• Homework

Our final exam is on Wednesday December 16 at 11:00 am. (Note it is earlier than our usual class time). You may download the Sample Final Exam Questions to prepare for the mandatory part.

Handouts:

• Sample Test 1
• Sample Test 2
• Sample Final Exam Questions
• Kruskal's and Prim's algorithm
• Birkhoff's Theorem
• "Complete failure" of the Ford-Fulkerson algorithm

External links:

• Java applets simulating Dijkstra's algorithm (by Kenji Ikeda).
• Java applets simulating Kruskal's algorithm (by Kenji Ikeda).
• Java applets simulating Prim's algorithm (by Kenji Ikeda).
• Java applets simulating the Ford-Fulkerson algorithm (by Kenji Ikeda).
• Mike Copley's Heapsort applet