Calendar
(tentative for now)
Content and Reading |
||
---|---|---|
Topic | Week | Reading |
Unit 1 -Logic, Proofs and Induction |
||
Introduction and Proofs | 1 | Chapter 1 |
Induction I and II | 1, 2 | Chapter 5 |
Basic Structures: Sets, Functions etc. | 3, 4 | Chapter 2 |
Unit 2 - Structures, Graphs and Relations |
||
Number Theory | 5 | Chapter 4 |
Algorithms, Growth Functions and Complexity | 6 | Chapter 3 |
Graph Theory and Coloring | 7 | Chapter 10 |
Relations | 8 | Chapter 9 |
Unit 3 - Counting |
||
Basics of Counting | 9 | Chapter 6 |
Divide and Conquer Recurrences | 10 | Chapter 8.3 |
Linear Recurrences | 11 | Chapter 8.2 |
Inclusion and Exclusion | 12 | Chapter 8.5 |
Unit 4 - Probability |
||
Probability and Applications | 13, 14 | Chapter 7 |
Finite State Machines | 14 | Chapter 13.4, 13.5 |
Exams, Quizzes and Recitations |
||
---|---|---|
Exam/Quiz/Recitations | Date | Topics |
Exams |
||
Quiz | September 29 | Unit 1 |
Take Home Mid Terms | Access = November 15, Submission = November 17 | Unit 1, 2,3 |
Quiz | October 27 | Unit 3 |
Final Project | December 5 | Project Submission |
Final Exam (Take Home--Tentative) | TBD | TBD |
Recitations |
||
Recitations 1 | October 18 | Sets and Number Theory, Algorithms |
Recitations 2 | November 3 | Graph Theory and Relations |
Recitations 3 | November 10 | Counting |
Recitations 4 | November 29 | Recurrences |
Recitation 5 | December 1 | Probability and Turing Machines |
All dates are tentative. If you have a scheduling conflict due to extenuating circumstances, please discuss it with the instructor as soon as possible.