MS = Automata Textbook (Michael Sipser)
CLRS = Algorithms Textbook
(Cormen, Leiserson, Rivest, Stein)
| Date | Topic | Reading | Wk | Additional Reading Notes | ||
| W | Jan | 18 |
Mon, Jan 17: MLK
Holiday |
MS: Chap 0 |
1 |
Video: Lecture 1 |
| M/W | Jan | 23,25 |
Mathematical Notation Regular Languages: DFA |
MS: Chap 1.1 | 2 | |
| M/W | Jan/Feb | 30,1 |
NFA's Regular Expressions |
MS: Chap 1.2-1.3 |
3 |
Unix/Java RegEx: pdf |
| M/W | Feb | 6,8 |
Pumping Lemma I Context-Free Grammars |
MS: Chap 1.4, 2.1 | 4 | |
| M/W | Feb | 13,15 |
Pushdown Automata Pumping Lemma II |
MS: Chap 2.2-2.3 |
5 | |
| M/W | Feb | 20,22 |
Turing Machines |
MS: Chap 3 | 6 |
Turing Machines, Decidability: pdf, ppt Video: Lecture 10, Lecture 11 |
| M/W | Feb | 27,29 |
Decidability Reducibility |
MS: Chap 4-5 |
7 |
Video: Lecture 12, Lecture 13 |
| M/W | Mar | 5,7 |
Time Complexity, P/NP Midterm, Wednesday, Mar. 7 |
MS: Chap 7, CLRS: Chap 34 | 8 |
Video: Lecture 14 |
| M/W | Mar | 12,14 |
Spring Break |
. |
9 |
. |
| M/W | Mar | 19,21 |
Complexity, Algorithm Basics, Notation |
CLRS: Chap 1-3 | 10 |
Algorithm Basics, Recurrence Relations Video: Lecture 15, Lecture 16 |
| M/W | Mar | 26,28 |
Recurrence Relations |
CLRS: Chap 4 | 11 |
Class in SSB 118, Guest Speakers, both Monday and Wednesday. Same time, 11:30-12:45. |
| M/W | Apr | 2,4 |
Selection, Sorting |
CLRS: Chap 6-9 | 12 |
Selection: pdf Video: Lecture 17, Lecture 18 |
| M/W | Apr | 9,11 |
Graphs, Shortest Path |
CLRS: Chap 22-24,26 |
13 |
Non-comparison sorting: pdf Graphs, Greedy Algorithms: pdf, pptx Video: Lecture 19, Lecture 20 |
| M/W | Apr | 16,18 |
Dynamic Programming |
CLRS: Chap 15, 25 |
14 |
Max Flow: pdf, ppt, Dynamic Programming: pdf Video: Lecture 21, Lecture 22 |
| M/W | Apr | 23,25 |
String Matching, Other Topics? Voronoi Diagrams? |
CLRS: Chap 32 | 15 |
Video: Lecture 23, Lecture 24 |
| M,F | May | 4 |
Final Exam Week (normal classes scheduled on Monday) |
. | Finals Week |
Final Exam Friday 10:00-12:45 Video: Lecture 25 |