CSC173

Spring 2018 - MW 1050-1305 - Dewey 1-101

Mon Day DOW Special Class Lecture Unit Topic Reading Project
1 17 W   1 0 Intro   C Programming for Java Programmers  
1 22 M   2 1.1 Finite Automata and Regular Expressions Patterns & Automata FOCS 10.0-10.3  
1 24 W   3 1.2   Equivalence of DFAs and NFAs FOCS 10.4  
1 29 M   4 1.3   Regular Expressions FOCS 10.5-10.7  
1 31 W   5 1.4   From REs to Automata FOCS 10.8  
2 5 M   6 1.5   From Automata to REs FOCS 10.9  
2 7 W   7     Exam   Project 1 due
2 12 M   8 2.1 Grammars and Parsing Grammars & Languages FOCS 11.0-11.3  
2 14 W   9 2.2   Parse Trees, Ambiguity, & Parsing FOCS 11.4-11.6  
2 19 M   10 2.3   Table-Driven Parsing FOCS 11.7  
2 21 W   11 2.4   Pushdown Automata Sipser 2.2  
2 26 M   12 2.5   Regular and Context-Free Languages FOCS 11.8; Sipser 1.4  
2 28 W   13     Exam   Project 2 due
3 5 M   14 3.1 Turing Machines and Computability Turing Machines Sipser 3.1  
3 7 W   15 3.2   TM Variants & Church-Turing Sipser 3.2-3.3  
3 12 M Spring Break            
3 14 W Spring Break            
3 19 M   16 3.3   Decidability Sipser 3.3-4.1  
3 21 W   17 3.4   The Halting Problem Sipser 4.2  
3 26 M   18     Exam   Project 3 due
3 28 W   29 4.1 Relational Algebra and Databases Tables, Keys, Indexes FOCS 8.0-8.6  
4 2 M   20 4.2   Relational Algebra FOCS 8.7  
4 4 W   21 4.3   Querying and Query Optimization FOCS 8.8-8.9  
4 9 M   22 4.4   SQL Elmasri & Navathe Ch 6  
4 11 W   23     Exam   Project 4 due
4 16 M   24 5.1 Boolean Logic and Boolean Circuits Boolean Algebra (Propositional Logic) FOCS 12.0-12.5, 12.7-8  
4 18 W   25 5.2   Gates, Circuits, and Logical Expressions FOCS 13.0-13.5  
4 23 M   26 5.3   Karnaugh Maps and Circuit Minimization FOCS 12.6  
4 25 W   27     Exam   Project 5 due
4 30 M     No class   No class    
                   
5 7 M     Final Exam: Monday, May 7, 0830        

Last change: Thu Dec 7 10:27:53 2017