Topic modules are found on Ed Discussion lessons (refer to the Schedule for due dates).Â
Depending on what will best support your learning, you may want to complete a lesson prior to its coverage in class or directly after.
Stable Matching [slide deck|pdf version]
Asymptotic Analysis [slide deck| pdf version]
Graphs (traversals & bipartite) [slide deck | pdf version]
Graphs (directed) [slide deck | pdf version]
Greedy algorithms [slide deck | pdf version]
Dynamic programming [slide deck | pdf version]
Divide-and-conquer algorithms [slide deck | pdf version]
Network flow [slide deck | pdf version]
Intractability [slide deck | pdf version]