Lectures

• Mon Aug 23, 2021

  Lecture 1: Administrivia and what is an algorithm?

  Reading: Erickson 0 and CLRS 2–2.2

  Recording

  Scribbles

• Wed Aug 25, 2021

  Lecture 2: Asymptotic notation for running times and important functions

  Reading: CLRS 3

  Recording

  Scribbles

• Mon Aug 30, 2021

  Lecture 3: Reductions, induction, and recursion

  Reading: Erickson I, 1–1.2

  Recording

  Scribbles

• Wed Sep 1, 2021

  Lecture 4: Divide-and-conquer, mergesort, and quicksort

  Reading: Erickson 1.4–1.6 and CLRS 2.3, 4.0, 4.3, 7–7.1

  Recording

  Scribbles

• Wed Sep 8, 2021

  Lecture 5: Analyzing divide-and-conquer algorithms

  Reading: Erickson 1.7, 1.9 and CLRS 4.4–4.5

  Recording

  Scribbles

• Mon Sep 13, 2021

  Lecture 6: Divide-and-conquer with unbalanced recursion trees, (median) selection

  Reading: Erickson 1.5, 1.8 and CLRS 7–7.2, 7.4.1, 9.0, 9.3

  Recording

  Scribbles

• Wed Sep 15, 2021

  Lecture 7: Backtracking, game trees, rod cutting, subset sum

  Reading: Erickson 2, 2.2–2.5 and CLRS 15.1

  Recording

  Scribbles

• Mon Sep 20, 2021

  Lecture 8: Dynamic programming, Fibonacci numbers, rod cutting, and subset sum

  Reading: Erickson 3.1, 3.3–3.5, 3.8 and CLRS 15–15.1, 15.3–15.4

  Recording

  Scribbles

• Mon Sep 20, 2021

  Lecture 9: Edit distance, longest increasing subsequence(?)

  Reading: Erickson 2.6, 3.6–3.7 and CLRS 15.4

  Recording

  Scribbles

• Mon Sep 27, 2021

  Lecture 10: Maximum independent set in trees, greedy algorithms, and class scheduling

  Reading: Erickson 3.10, 4.2–4.3 and CLRS 16–16.2

  Recording

  Scribbles

• Wed Sep 29, 2021

  Lecture 11: Huffman codes

  Reading: Erickson 4.4 and CLRS 16.3

  Recording

  Scribbles

• Mon Oct 11, 2021

  Lecture 12: Graph representations and graph traversal

  Reading: Erickson 5–5.6 and CLRS 22–22.2

  Recording

  Scribbles

• Wed Oct 13, 2021

  Lecture 13: Counting graphs components, graph reductions, flood fill, and intro to depth-first search

  Reading: Erickson 5.6–5.7, 6–6.2 and CLRS 22–22.4

  Recording

  Scribbles

• Mon Oct 18, 2021

  Lecture 14: Applications of depth-first search including directed cycle detection, topological sort, and another view of dynamic programming

  Reading: Erickson 6–6.4 and CLRS 22.3–22.4 (and 24.2 for shortest paths in DAGs)

  Recording

  Scribbles

• Wed Oct 20, 2021

  Lecture 15: Minimum spanning trees, Kruskal's algorithm, the Prim-Jarník algorithm, and Borůvka's algorithm

  Reading: Erickson 7 and CLRS 23

  Recording

  Scribbles

• Mon Oct 25, 2021

  Lecture 16: Finishing minimum spanning trees, the Prim-Jarník algorithm, Borůvka's algorithm, and beginning single source shortest paths

  Reading: Erickson 7, 8–8.3 and CLRS 23, 24–24.1

  Recording

  Scribbles

• Wed Oct 27, 2021

  Lecture 17: Single source shortest paths, SSSPs in DAGs, and Bellman-Ford

  Reading: Erickson 8–8.3, 8.5, 8.7 and CLRS 24–24.2, 24.5

  Recording

  Scribbles

• Mon Nov 1, 2021

  Lecture 18: Single source shortest paths, Dijkstra's algorithm and BFS, all-pairs shortest paths, and Floyd-Warshall

  Reading: Erickson 8.4, 8.6, 9.1–9.2, 9.5, 9.8 and CLRS 24.3, 25, 25.2

  Recording

  Scribbles

• Wed Nov 3, 2021

  Lecture 19: Maximum flows and minimum cuts

  Reading: Erickson 10–10.4 and CLRS 26–26.2

  Recording

  Scribbles

• Mon Nov 8, 2021

  Lecture 20: Ford-Fulkerson augmenting paths, flow decompositions, Edmonds-Karp maximum flow algorithms, and recent results

  Reading: Erickson 10–10.7 and CLRS 26–26.2

  Recording

  Scribbles

• Wed Nov 10, 2021

  Lecture 21: Applications of maximum flows including edge disjoint paths, maximum bipartite matching, and other assignment problems

  Reading: Erickson 11 and CLRS 26.3

  Recording

  Scribbles

• Mon Nov 29, 2021

  Lecture 22: NP-hardness, CircuitSAT, and SAT

  Reading: Erickson 12.1–12.6 and CLRS 34–34.4

  Recording

  Scribbles

• Wed Dec 1, 2021

  Lecture 23: More NP-hard problems including MaxIndSet, MaxClique, VertexCover, 3Color, and SubsetSum

  Reading: Erickson 12.7–12.12 and CLRS 34.5