-
Dec 7: Second practice final walkthrough
-
Dec 5: Final exam review (part 2)
-
Dec 5: Final exam review (part 1)
-
Nov 16: NP-hardness: Why bother, choosing a good…
-
Nov 14: More on NP hardness, reduction from…
-
Nov 9: P, NP, NP-hardness, SAT, 3SAT, reduction…
-
Nov 7: Polynomial-time reductions
-
Nov 04: Second practice Midterm 2
-
Oct 31: Bellman-Ford again, all-pairs shortest…
-
Oct 26: Dijkstra and Bellman-Ford
-
Oct 24: topological sort, dag dynamic…
-
Oct 20: Depth-first search, dags, and strong…
-
Oct 18: Graph representations and traversal
-
Oct 12: Tree-shaped dynamic programming
-
Oct 10: Dynamic programming: Edit distance
-
CS 374 lecture capture
-
-
Midterm 1 — Practice Exam 2
-
Sep 21: Midterm 1 review (redo)
-
Sep 12: Language transformations
-
Sep 07: NFA variations and (most of)…
-
Sep 5: Fooling sets and intro to NFAs
-
Aug 31: DFA product construction
Search for ""