Jan 1620 
Administrivia and course goals
Introduction and history; strings
[slides1, slides2] 
String induction
[induction notes, more] [solutions] 
Languages and regular expressions [slides] 
Regular expressions
[solutions] 
Jan 2327 
DFAs, product construction
[Automata Tutor] [slides] DFA Proofs 
DFA construction
[solutions] 
Nondeterminism, NFAs
Jeff's NFA notes
[slides] 
DFA product construction
[solutions] 
Jan�30Feb�3 
NFAs continued, equivalence with DFAs and regular expressions
Jeff's NFA notes
[slides] 
DFA/NFA transformation
[solutions] 
Proving nonregularity via fooling sets
[slides]
[DFA Proofs][Fooling sets guide] 
Proving nonregularity
[solutions] 
Feb 610 
Contextfree languages and grammars
[slides]

Contextfree grammars
[solutions] 
Turing machines: history, formal definitions, examples, variations
[slides]

Regular or not?
[solutions] 
Feb 1317 
Universal Turing Machine, RAM simulation, P
[UTM slides][complexity slides]

Turing machine design
[solutions] 
Optional review for Midterm 1 
Optional review for Midterm 1 
Midterm 1: Monday, February 20, 79pm
Conflict exam: Tuesday, February 21 
Feb 2024 
Recursion: Hanoi, mergesort
[slides][solving recurrences]

Hint: Binary search
[solutions] 
Divide and conquer: lineartime selection, Karatsuba multiplication
[recurrence notes] [slides]

Divide and conquer
[solutions] 
Feb�27Mar�3 
Backtracking: independent set, longest increasing subsequence
[slides] 
Backtracking
[solutions] 
Dynamic programming: splitting strings, longest increasing subsequence
[slides] 
Dynamic programming
[solutions] 
Mar 610 
More DP: Edit Distance, MIS in trees
[slides]

More dynamic programming
[solutions] 
CYK Algorithm, Graphs, basic search
[CYK slides, Graph search slides] 
Yet even still more dynamic programming
Drop deadline
[solutions] 
Mar 1317 
Directed graphs, depthfirst search
[slides]

Graph modeling
[solutions] 
Catch up lecture
[Graph notes]

Graph modeling
[solutions] 
Mar 2024 
Spring break 
Mar 2731 
BFS and Shortest Paths
[slides]

Shortest paths
[solutions] 
Shortest Paths with Negative Lengths via DP
[slides]

More shortest paths
[solutions] 
Apr 37 
Greedy algorithms
[slides]

Greedy
[solutions] 
MST Algorithms
[slides]

Optional review for Midterm 2 
Midterm 2: Monday, April 10, 79pm
Conflict exam: Tuesday, April 11 
Apr 1014 
No lecture in lieu of midterm 
MST
[solutions] 
Undecidability: halting problem, diagonalization, reductions
[slides]

Undecidability via reductions
[solutions] 
Apr 1721 
Polynomial time Reductions
[slides]

Self Reductions
[solutions] 
NP, NPCompleteness,
3SAT to Independent Set
[slides][helpful video on P vs NP] 
NPhardness proofs
[solutions] 
Apr 2428 
More NPhardness reductions: 3coloring, Hamiltonian cycle
[slides]

NPHardness, the final chapter
[solutions] 
Undecidability: more reductions, Rice's theorem
[slides]
ICES Forms 
Using Rice's Theorem
ICES Forms
[solutions] 
May 15 
Wrapup and preliminary review for the final exam 
Review for final 
Reading Day 

Final exam: Monday, May 8th, 710pm
Conflict exam: May 9th, 9amnoon 