CSC173

Spring 2025 - TR 1400-1515 - Wegmans 1400

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

Last change: Thu Feb 6 09:15:30 2025