CSC173

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

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

Last change: Tue Jan 15 12:07:24 2019