CSC173

Spring 2021 - MW 1150-1305 - See BlackBoard for Zoom info

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

Last change: Wed Jan 13 09:42:59 2021