01:19:59duration 1 hour 19 minutes
CS 374 Fall 2025
Class recording
NP-hardness: Vertex Cover to Subset Sum, why…
NP-hardness: Vertex Cover to Subset Sum, why bother, choosing which problem to reduce from
NP-hardness: Vertex cover to Hamiltonian cycle
P vs NP, NP-hardness, 3SAT, reduction to max…
P vs NP, NP-hardness, 3SAT, reduction to max independent set
Reductions: Cliques and friends, Hamiltonian…
Reductions: Cliques and friends, Hamiltonian cycles
Midterm 2 Practice 1
Bellman-Ford via layering and all-pairs shortest…
Bellman-Ford via layering and all-pairs shortest paths
Shortest paths via Dijkstra and Bellman-Ford
Dag DP; generic shortest paths, DagSSSP, BFS
Graph layering, WFS variants, depth-first search,…
Graph layering, WFS variants, depth-first search, topological sort
Graphs: definitions, representations, data…
Graphs: definitions, representations, data structures, traversal, reductions, flood fill
Tree-shaped dynamic programming: woodcutting,…
Tree-shaped dynamic programming: woodcutting, maximum independent set in trees
Sequence dynamic programming: Edit distance
Dynamic programming: Fibonacci, text segmentation…
Dynamic programming: Fibonacci, text segmentation again
Backtracking: n queens, game trees, text…
Backtracking: n queens, game trees, text segmentation
Divide and conquer: selection, multiplication
Recursion: Hanoi, mergesort, quicksort
Midterm 1 Practice 1
Turing machines
Context-free languages and grammars
Language transformations
NFAs: ε-transitions, equivalence with…
NFAs: ε-transitions, equivalence with DFAs and regular expressions
Proving nonregularity via fooling sets; NFAs:…
Proving nonregularity via fooling sets; NFAs: intuition and examples