Topic modules

Complete these prior to the specified class (refer to the Schedule).

1. Stable Matching [slide deck for both Stable Matching modules|pdf version]

   • Stable Matching - module 1

   • Stable Matching - module 2

2. Asymptotic Analysis [slide deck for Asymptotic Analysis module | pdf version]

3. Graphs (traversals & bipartite) [slide deck for all 3 Graphs (traversals & bipartite) modules | pdf version]

   • Graphs (traversals & bipartite) - module 1

   • Graphs (traversals & bipartite) - module 2

   • Graphs (traversals & bipartite) - module 3 

4. Graphs (directed) [slide deck for both Graphs (directed) modules | pdf version]

   • Graphs (directed) - module 1 

   • Graphs (directed) - module 2 

5. Greedy algorithms [slide deck for all 3 Greedy modules | pdf version]

   • Greedy algorithms - module 1

   • Greedy algorithms - module 2

   • Greedy algorithms - module 3

6. Dynamic programming [slide deck for both DP modules | pdf version]

   • Dynamic programming - module 1

   • Dynamic programming - module 2

7. Divide-and-conquer algorithms [slide deck for both divide-and-conquer modules | pdf version]

   • Divide-and-conquer - module 1

   • Divide-and-conquer - module 2

8. Network flow [slide deck for both network flow modules | pdf version]

   • Network flow - module 1

   • Network flow - module 2

9. Intractability [slide deck for both intractability modules | pdf version]

   • Intractability - module 1

   • Intractability - module 2