Tentative Schedule and Learning Goals¶
You should aim to complete all assigned readings in advance of the corresponding classroom sessions. This will facilitate a much deeper understanding of the material as we work through additional examples in class and it will also help you complete the assigned homework. Please follow the links (as they become available) in the Due column below to see all assigned exercises.
|9/4||Preliminaries; Propositional Logic||1; 2.1|
|9/9||Logic: Statements; Arguments||2.2–2.3|
|9/11||Application: Digital Circuits||2.4–2.5||Hw1|
|9/18||Logical arguments with quantifiers||3.3–3.4||Hw2|
|10/9||Application: The GCD Algorithm||4.8; 5.5||Midterm 1|
|10/21||Recursive definitions of sequences||5.6|
|10/28||Recursion & Induction||5.9|
|10/30||Set theory||6 (all sections)||Hw6|
|11/11||Application: Modular Arithmetic||8.4|
|11/13||Counting: Product/Sum Rules||9.1–9.3||Hw8|
|Thanksgiving Break: Nov 27 (after classes) - Dec 1|
|12/4||Graphs: Trails, Paths, Circuits||10.1–10.2||Hw10|
|12/11||Application: Coloring Graphs||Instructor Notes||Hw11|
|Review Period: Dec 13-14; Exam Period: Dec 15-20|
By the end of this course, students will be able to:
- construct logical statements from natural language descriptions, and vice versa.
- develop proofs for mathematical statements and the correctness of simple computational procedures.
- perform combinatorial and probability calculations by using techniques for counting.
- reason about fundamental concepts and properties of discrete combinatorial structures like graphs and trees
- develop basic computational thinking skills and an appreciation for the critical role played by discrete mathematics in computational applications.