CSC173

Fall 2020 - MW 1400-1515

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

Last change: Tue Sep 22 17:24:16 2020