CSC173

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

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

Last change: Mon Mar 30 15:53:44 2020