CSC173

Spring 2017 - MW 1150-1305 - Dewey 1-101

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

Last change: Mon Mar 27 16:11:18 2017