Mon | Day | DOW | Special | Class | Lecture | Unit | Topic | Reading | Project |
---|---|---|---|---|---|---|---|---|---|

8 | 31 | R | 1 | Intro | C Programming for Java Programmers | ||||

9 | 5 | T | 2 | 1.1 | Finite Automata and Regular Expressions | Patterns & Automata | FOCS 10.0-10.3 | ||

9 | 7 | R | 3 | 1.2 | Equivalence of DFAs and NFAs | FOCS 10.4 | |||

9 | 12 | T | 4 | 1.3 | Regular Expressions | FOCS 10.5-10.7 | |||

9 | 14 | R | 5 | 1.4 | From REs to Automata | FOCS 10.8 | |||

9 | 19 | T | 6 | 1.5 | From Automata to REs | FOCS 10.9 | |||

9 | 21 | R | 7 | Exam | Project 1 due | ||||

9 | 26 | T | 8 | 2.1 | Grammars and Parsing | Grammars & Languages | FOCS 11.0-11.3 | ||

9 | 28 | R | 9 | 2.2 | Parse Trees, Ambiguity, & Parsing | FOCS 11.4-11.6 | |||

10 | 3 | T | 10 | 2.3 | Table-Driven Parsing | FOCS 11.7 | |||

10 | 5 | R | 11 | 2.4 | Pushdown Automata | Sipser 2.2 | |||

10 | 10 | T | Fall Break | ||||||

10 | 12 | R | 12 | 2.5 | Regular and Context-Free Languages | FOCS 11.8; Sipser 1.4 | |||

10 | 17 | T | 13 | Exam | Project 2 due | ||||

10 | 19 | R | 14 | 3.1 | Turing Machines and Computability | Turing Machines | Sipser 3.1 | ||

10 | 24 | T | 15 | 3.2 | TM Variants & Church-Turing | Sipser 3.2-3.3 | |||

10 | 26 | R | 16 | 3.3 | Decidability | Sipser 3.3-4.1 | |||

10 | 31 | T | 17 | 3.4 | The Halting Problem | Sipser 4.2 | |||

11 | 2 | R | 18 | Exam | Project 3 due | ||||

11 | 7 | T | 19 | 4.1 | Relational Algebra and Databases | Tables, Keys, Indexes | FOCS 8.0-8.6 | ||

11 | 9 | R | 20 | 4.2 | Relational Algebra | FOCS 8.7 | |||

11 | 14 | T | 21 | 4.3 | Querying and Query Optimization | FOCS 8.8-8.9 | |||

11 | 16 | R | 22 | 4.4 | SQL | Elmasri & Navathe Ch 6 | |||

11 | 21 | T | Thanksgiving | ||||||

11 | 23 | R | Thanksgiving | ||||||

11 | 28 | T | 23 | Exam | Project 4 due | ||||

11 | 30 | R | 24 | 5.1 | Boolean Logic and Boolean Circuits | Boolean Algebra (Propositional Logic) | FOCS 12.0-12.5, 12.7-8 | ||

12 | 5 | T | 25 | 5.2 | Gates, Circuits, and Logical Expressions | FOCS 13.0-13.5 | |||

12 | 7 | R | 26 | 5.3 | Karnaugh Maps and Circuit Minimization | FOCS 12.6 | |||

12 | 12 | T | 27 | Exam | Project 5 due | ||||

12 | 20 | W | 1230 | Final Exam: Wednesday, December 20, 1230 |

*Last change: Mon Jun 19 09:32:31 2017*