| Week | Date | Topic/Read Before Class | Assignment |
| 1 | M, 01/11 | Course information, go over the syllabus
Section 1.1 Set Theory |
|
| W, 01/13 | Section 1.1 Set Theory (cont'd)
Section 1.6 Recursive definitions |
Homework 1 (pdf) | |
| Th, 01/14 | Make-up Thursday class due to conference cancellations
time: 6:05pm-6:55pm location: Rekhi 214 Section 1.6 Recursive definitions (cont'd) |
||
| F, 01/15 | |||
| 2 | M, 01/18 | no class -- Martin Luther King, Jr. Day recess | |
| W, 01/20 | Homework 2 (pdf) | ||
| Tu, 01/19 | Make-up Thursday class due to conference cancellations
time: 6:05pm-6:55pm location: Rekhi 214 |
||
| F, 01/22 | |||
| 3 | M, 01/25 | ||
| W, 01/27 | Homework 3 (pdf) | ||
| F, 01/29 | |||
| 4 | M, 02/01 | no class -- Conference | |
| W, 02/03 | no class -- Conference | ||
| F, 02/05 | no class -- Winter Carnival | ||
| 5 | M, 02/08 | ||
| W, 02/10 | Homework 4 (pdf) | ||
| R, 02/11 | Midterm exam 1 Time: 6:00pm - 7:30pm Location: EERC 100 Sections covered: 1.1 Set Theory 1.2 Cartesian Product 1.6 Recursive Definitions 1.7 Mathematical Induction 2.1 Strings and Languages 2.2 Finite Specification of Languges 2.3 Regular Sets Sections NOT covered: 1.3, 1.4, 1.5, 1.8, Regular Expressions from 2.3 |
||
| F, 02/12 | |||
| 6 | M, 02/15 | (Note: the MTU Career Fair is tomorrow, on Tuesday, 2/16.) | |
| W, 02/17 | Homework 5 (pdf) | ||
| F, 02/19 | |||
| 7 | M, 02/22 | ||
| W, 02/24 | Homework 6 (pdf) | ||
| F, 02/26 | |||
| 8 | M, 02/29 | ||
| W, 03/02 | Homework 7 (pdf) | ||
| R, 03/03 | Midterm exam 2 Time: 6:00pm - 7:30pm Location: M&M U115 Sections covered: 2.4 Regular Expressions (5.1 A Finite-State Machine) (we didn't cover the example here, but it's straightforward) 5.2 Deterministic Finite Automata 5.3 State Diagrams and Examples 5.4 Nondeterministic Finite Automata 5.5 Lambda-transitions 5.6 Removing Nondeterminism Sections NOT covered: 2.4 Regular Expressions and Text Searching 5.7 DFA Minimization (will be on exam 3) |
||
| F, 03/04 | no class -- Exam 2 day | ||
| -- | M, 03/07 | no class -- Spring recess | |
| W, 03/09 | no class -- Spring recess | ||
| F, 03/11 | no class -- Spring recess | ||
| 9 | M, 03/14 | ||
| W, 03/16 | Homework 8 (pdf) | ||
| F, 03/18 | |||
| 10 | M, 03/21 | ||
| W, 03/23 | Homework 9 (pdf) | ||
| F, 03/25 | |||
| 11 | M, 03/28 | ||
| W, 03/30 | Homework 10 (pdf) | ||
| R, 03/31 | Midterm exam 3 Time: 6:00pm - 7:30pm Location: M&M U115 Sections covered: 5.7 DFA Minimization 3.1 Context-Free Grammars and Languages 3.2 Examples of Grammars and Languages 3.5 Leftmost Derivations and Ambiguity 4.1 Grammar Transformations 4.2 Elimination of Lambda-Rules 4.3 Elimination of Chain Rules 4.4 Useless Symbols 4.5 Chomsky Normal Form Sections NOT covered: 3.3 Regular Grammars 3.4 Verifying grammars 4.6 The CYK algorithm (will be on exam 4) |
||
| F, 04/01 | |||
| 12 | M, 04/04 | ||
| W, 04/06 | Homework 11 (pdf) | ||
| F, 04/08 | |||
| 13 | M, 04/11 | ||
| W, 04/13 | Homework 12 (pdf) | ||
| F, 04/15 | |||
| 14 | M, 04/18 | ||
| W, 04/20 | |||
| F, 04/22 | |||
| Finals | M, 04/25 | Exam 4 Time: 10:15am - 12:15pm Location: Forestry G002 Sections covered: 4.6 The CYK Algorithm 7.1 Pushdown Automata 8.1, 8.2 Turing Machines 18.1, 18.2, 19.1 LL(k) grammars, grammar graphs, lookahead sets Supplemental: Floating point arithmetic Sections NOT covered: 4.8, 7.2 - 7.5, 8.3 - 8.8 18.3 - 18.4, 19.2 - 19.8 |
Note: A week-long homework is assigned almost every Wednesday.