Fall 2021 CS 374 Algos and Models of Computation Section A
Fall 2021 CS 374 Algos and Models of Computation Section A
-
Review Session
CS 374 Fall 2021 Section A Final Review Session
-
Undecidability Reductions, Rice's Theorem
CS 374 Fall 2021 Section A Lecture 26
-
More NP hardness, Undecidability
CS 374 Fall 2021 Section A Lecture 25
-
More NP Hardness: Hamiltonian Cycle wrap-up, Hamiltonian Path, other NP-hard problems and general strategies
CS 374 Fall 2021 Section A Lecture 24
-
3SAT reduces to 3COLOR, 3SAT reduces to Hamiltonian Cycle
CS 374 Fall 2021 Section A Lecture 23
-
P/NP, NP hardness, circuit SAT, formula SAT, 3SAT, CircuitSAT reduces to 3SAT reduces to CLIQUE
CS 374 Fall 2021 Section A Lecture 22
-
Reductions
CS 374 Fall 2021 Section A Lecture 21
-
Midterm practice
CS 374 Fall 2021 Section A Midterm 2 Practice
-
All pairs shortest paths
CS 374 Fall 2021 Section A Lecture 20
-
Shortest paths
CS 374 Fall 2021 Section A Lecture 19
-
DP in DAGs, strongly connected components, generic shortest paths
CS 374 Fall 2021 Section A Lecture-18
-
Depth-first search, Dynamic Programming in DAGs
CS 374 Fall 2021 Section A Lecture 17
-
Graphs: definitions, representations, data structures, traversal
CS 374 Fall 2021 Section A Lecture 16
-
Tree shaped DP: optimal binary search trees
CS 374 Fall 2021 Section A Lecture 15
-
Sequence DP: Edit Distance
CS 374 Fall 2021 Section A Lecture 14
-
Dynamic programming
CS 374 Fall 2021 Section A Lecture 13
-
Backtracking, n-queens, game trees, text segmentation
CS 374 Fall 2021 Section A Lecture 12
-
Divide and conquer: Karatsuba multiplication, linear-time selection
CS 374 Fall 2021 Section A Lecture 11
-
Recursion: Hanoi, Mergesort, Quicksort
CS 374 Fall 2021 Section A Lecture 10
-
Midterm review
CS 374 Fall 2021 Section A Optional Midterm Review
-
Turing Machines
CS 374 Fall 2021 Section A Lecture 9
-
Context Free Languages
CS 374 Fall 2021 Section A Lecture 8
-
Regular expressions to NFAs, Language Transformations
CS 374 Fall 2021 Section A Lecture 7
-
NFAs, epsilon-transitions
CS 374 Fall 2021 Section A Lecture 6
-
Fooling sets, proving nonregularity, NFAs
CS 374 Fall 2021 Section A Lecture 5
-
Product constructions of DFAs, Closure Properties
CS 374 Fall 2021 Section A Lecture 4
-
DFAs
CS 374 Lecture 3 Fall 2021 Section A
-
Languages and Regular Expressions
CS 374 Fall 2021 Section A Lecture 2
-
Introduction, String induction
CS 374 Lecture Fall 2021 Section A Lecture 1
Search for ""