CSCI 1323 (Discrete Structures):
Lecture Topics and Assignments

The table below shows what we will be discussing in each class meeting, readings (from the textbook unless otherwise indicated), dates of quizzes and exams, and due dates for homeworks. Dates of exams are fixed; other items are subject to change. Homework is due at 5pm on the date shown, unless otherwise indicated.

1.6, 2.3
Date Topics Reading Due dates
January 17 (Th) No class    
January 22 (T) No class    
January 24 (Th) About the course; a little about propositional logic (Notes) 1.1, 1.2  
January 29 (T) Propositional logic, continued (Notes)    
January 31 (Th) Predicate logic (Notes) 1.3, 1.4  
February 5 (T) Predicate logic, continued (Notes)   Homework 1 (HTML, PDF)
February 7 (Th) Predicate logic, continued (Notes)   Quiz 1
February 12 (T) Proof techniques (Notes) 2.1 Homework 2 (HTML, PDF)
February 14 (Th) Mathematical induction (Notes) 2.2, Appendix B  
February 19 (T) Review of predicate logic; mathematical induction, continued (Notes)   Quiz 2
February 21 (Th) Mathematical induction, continued; recursive definitions (Notes) 2.4  
February 26 (T) Recursive definitions, continued (Notes)   Homework 3 (HTML, PDF)
February 28 (Th) Review for midterm (Notes)   Quiz 3
March 5 (T) Midterm exam (review in HTML, PDF)   Homework 4 (HTML, PDF)
March 7 (Th) No class    
March 12 (T) Holiday    
March 14 (Th) Holiday    
March 19 (T) No class    
March 21 (Th) No class    
March 26 (T) Recurrence relations (Notes) 2.5, Appendix C  
March 28 (Th) Analysis of algorithms (Notes) 2.6  
April 2 (T) No class    
April 4 (Th) Sets (Notes) 3.1 Homework 5 (HTML, PDF)
April 9 (T) Counting (Notes) 3.2, 3.3  
April 11 (Th) Counting, continued; a little about probability (Notes) 3.4, 3.5 Quiz 4
April 16 (T) Proofs of program correctness (Notes)    
April 18 (Th) Proofs of program correctness, continued (Notes)    
April 23 (T) Functions and relations 4.1, 4.2, 4.4 (Notes)   Quiz 5
April 25 (Th) Functions and relations, continued (Notes)   Homework 6 (HTML, PDF)
April 30 (T) "Informal formal methods" revisited (Notes), (code),   Quiz 6
May 2 (Th) Course wrap-up and evaluations (Notes)   Homework 7 (HTML, PDF)
May 10 (F) (Not a class day)   Homework 8 (HTML, PDF)
May 14 (T), noon Final exam (review in HTML, PDF)    
May 15 (W) (Not a class day)   Homework X (HTML, PDF)