CSC173

Fall 2016 - TR 1400-1515 - Lattimore 201

Mon Day DOW Class Unit Topic References Project
9 1 R 1 Intro   C Programming for Java Programmers  
9 6 T 2 Finite Automata and Regular Expressions Patterns & Automata 10.0-10.3  
9 8 R 3   Equivalence of DFAs and NFAs 10.4  
9 13 T 4   Regular Expressions 10.5-10.7  
9 15 R 5   From REs to Automata 10.8  
9 20 T 6   From Automata to REs 10.9  
9 22 R 7   Exam   Project 1 due Sun 25 Sep 1159PM
9 27 T 8 Grammars and Parsing Grammars & Languages 11.0-11.3  
9 29 R 9   Parse Trees & Ambiguity 11.4-11.5  
10 4 T 10   Recursive Descent Parsing 11.6  
10 6 R 11   Table-Driven Parsing 11.7  
10 11 T 12   Grammars vs Regular Expressions 11.8  
10 13 R 13   Exam    
10 18 T Fall Break       Project 2 due Wed 19 Oct 1159PM
10 20 R 14 Turing Machines and Computability Turing Machines L&P 4.1-4.2  
10 25 T 15   Computing with TMs; Extensions to TMs L&P 4.2-4.3  
10 27 R 16   Universal TM, Church-Turing, and Halting Problem L&P 5.1-5.3  
11 1 T 17   Functional Programming & Lambda Calculus (briefly) Michaelson 1.0-2.7; the rest FYI  
11 3 R 18   Exam (no Lambda Calculus)   Project 3 due Sun 6 Nov 1159PM
11 8 T 19 Relational Algebra and Databases Tables, Keys, Indexes; SQL 8.0-8.6  
11 10 R 20   Relational Algebra 8.7  
11 15 T 21   Querying and Query Optimization 8.8-8.9  
11 17 R 22   SQL E&N reading posted  
11 22 T 23   Exam   Project 4 due Sun 27 Nov 1159PM
11 24 R Thanksgiving        
11 29 T 24 Boolean Logic and Boolean Circuits Boolean Algebra (Propositional Logic) 12.0-12.5, 12.7-8  
12 1 R 25 Note: exact schedule of topics may vary Gates, Circuits, and Logical Expressions 13.0-13.5  
12 6 T 26   Karnaugh Maps and Circuit Minimization 12.6  
12 8 R 27   NO CLASS    
12 13 T 28   Exam   Project 5 due Tue 13 Dec 1159PM
12 20 T 1230 Final Exam: Tuesday, December 20, 1230      

Last change: Wed Dec 7 14:21:27 2016