CSC173

Spring 2024 - TR 1400-1515 - Wegmans 1400

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

Last change: Mon Feb 12 11:20:27 2024