- 
    Class recordingShortest paths via Dijkstra and Bellman-Ford 
- 
    Class recordingDag DP; generic shortest paths, DagSSSP, BFS 
- 
    Class recordingGraph layering, WFS variants, depth-first search,… 
- 
    Class recordingGraphs: definitions, representations, data… 
- 
    Class recordingTree-shaped dynamic programming: woodcutting,… 
- 
    Class recordingSequence dynamic programming: Edit distance 
- 
    Class recordingDynamic programming: Fibonacci, text segmentation… 
- 
    Class recordingBacktracking: n queens, game trees, text… 
- 
    Class recordingDivide and conquer: selection, multiplication 
- 
    Class recordingRecursion: Hanoi, mergesort, quicksort 
- 
    Yay! The audio worked this time! (Well, except for sporadic short dropouts because my home internet sucks.)Midterm 1 Practice 2 (redo with sound) 
- 
    Unfortunately, my audio settings were messed up when I recorded this, so there is no sound.Midterm 1 Practice 2 (no sound) 
- 
    
- 
    Class recordingContext-free languages and grammars 
- 
    Class recordingLanguage transformations 
- 
    Class recordingNFAs: ε-transitions, equivalence with… 
- 
    Class recordingProving nonregularity via fooling sets; NFAs:… 
- 
    Class recordingSep 04: DFAs: product construction, closure,… 
- 
    Class recordingSep 02: DFAs: intuition, definitions, examples 
- 
    Class recordingAug 28: Regular languages and regular expressions 
- 
    Recursive definitions of strings, string length, concatenation How to derive a proof by induction Less rushed than last timeAug 26: Strings and Induction—Take 2 
- 
    Administrivia and course goals Recursive definitions of strings, string length, concatenation How to derive a proof by inductionAug 26: Administrivia, Strings, and Induction 
Search for ""
Public, Restricted
- Managers:
