CSC173

Fall 2023 - MW 1400-1515 - Wegmans 1400

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

Last change: Mon Jul 10 10:23:37 2023