Submit here or email me.

Submit here or email me.

WARNING: this is *NOT* a complete set of everything I cover in class. The slides below are taken from the following book: Algorithm Design by M.T.Goodrich and R.Tamassia

- Simple methods
- GreedyMethod
- DynamicProgramming
- Pseudo code for LCS (longest common subsequence)
- Java source for fast exponentiation and Fibonacci
- An interesting programming problem (for a more challenging version see below: APIO-2009)
- DivideAndConquer
- IntroSort

- Graphs
- Graphs background
- Depth-first search
- Breadth-first search
- Minimum Spanning Tree
- Disjoint-set data structure (aka union-find)
- Java source for fast union-find and Kruskal based on it
- ShortestPath
- Directed graphs
- Pseudo code for topologicalSort (corrected book version)
- Biconnectivity
- Network Flow

- NP-Completeness
- NP-Completeness definitions
- NP-Completeness reductions
- Approximation algorithms
- Smart Enumeration (added some slides June 2nd)

- Introduction to algorithms by T.H. Cormen et al (will only work through the Library proxy)
- Sudoku lecture notes
- Fibonacci code
- Fibonacci at Wikipedia
- APIO 2009 programming problems
- TSP material
- LKH (especially the report)
- Wiki 3Sat (good starting point)
- Four Color Theorem
- Pop quiz results

Last modified: Wed 3 Jun 2009 15:48:10 NZST