01:24:59duration 1 hour 24 minutes
Oct 13 — Dynamic programming with…
Oct 13 — Dynamic programming with sequences: Edit distance
Oct 8 — Dynamic programming: Fibonacci…
Oct 8 — Dynamic programming: Fibonacci numbers, faster text segmentation
01:25:00duration 1 hour 25 minutes
Oct 6 — Divide and conquer: multiplication;…
Oct 6 — Divide and conquer: multiplication; Backtracking: text segmentation
Oct 1 — Divide and conquer: quicksort and…
Oct 1 — Divide and conquer: quicksort and linear time selection
Class recording
Sep 29 — Recursion: Tower of Hanoi and…
Sep 29 — Recursion: Tower of Hanoi and mergesort
Midterm 1 Practice 1 Part I
Sep 22 — Turing machines
Sep 17 — Context-free grammars and languages
Sep 15 — Language transformations
Sep 10 — Proving nonregularity: fooling…
Sep 10 — Proving nonregularity: fooling sets (and closure properties)
Sep 8 — NFAs: ε-transitions,…
Sep 8 — NFAs: ε-transitions, equivalence with DFAs and regular expressions
Sep 3 — DFAs: product construction,…
Sep 3 — DFAs: product construction, closure, automatic=regular; NFAs: intuition and examples
Sep 1 — DFAs: intuition, definitions,…
Sep 1 — DFAs: intuition, definitions, examples
Aug 27 — Languages and regular expressions
Aug 25 — Course goals and administrivia;…
Aug 25 — Course goals and administrivia; strings and induction