CS173 Lecture Schedule
Fall 2016 Gul Agha
This outline shows what was/will be covered in each lecture, as well as exam dates and similar information. It is still tentative and based on what happened in a previous term.
Before each lecture, you are expected to do the posted reading assignment from the textbook. Please check the errata file for typos; report any new ones to Margaret (mfleck@illinois.edu). The corresponding Moodle quiz is due at 11:59pm the night before the lecture.
| Date | Examlets and HW | Lecture Topic | Readings | Lecture Summary | ||
|---|---|---|---|---|---|---|
| Aug 23 | Syllabus/Logic |
Lecture Notes will appear after each lecture |
||||
| Aug 25 | Logic | 1.1-1.4, 1.7; chapter 2 meetings and materials assigned work |
Lecture 2 | |||
| Aug 30 | Proofs | chapter 3 campus emergency info |
Lecture 3 | |||
| Sept 1 | HW 1 Due Friday | Number Theory | chapter 4 excuses etc |
Lecture 4 | ||
| Sept 6 | Modular Arithmetic/Sets | chapter 5 exam logistics academic integrity policy |
Lecture 5 | |||
| Sept 8 | Examlet 1: Logic and Proofs | Examlet1 | ||||
| Sept 13 | Relations | chapter 6 regrade requests |
Lecture 6 | |||
| Sept 15 | Functions | chapter 7 | Lecture 7 | |||
| Sept 20 | Functions | chapters 8 | Lecture 8 | |||
| Sept 22 | Examlet 2: Modular Arithmetic, Relations Sets | Examlet 2 | ||||
| Sept 27 | Graphs I | chapter 9 | Lecture 9 | |||
| Sept 29 | (no exam) | Graphs II (2-way bounding) | chapter 10 | Lecture 10 | ||
| Oct 4 | Induction | 1.5-1.6; chapter 11 | Lecture 11 | |||
| Oct 6 |
Examlet 3: Functions, Graphs, 2-way bounding |
Examlet 3 | ||||
| Oct 11 | More Induction & Recursive Definition | chapter 12 | Lecture 12 | |||
| Oct 13 |
|
Recursive Definitions (continued) |
chapter 12 (concluded) 13.1-13.2 |
(upto slide 16) |
||
| Oct 18 | Trees | chapter 13 (concluded) | ||||
| Oct 20 |
Examlet 4: Induction, Recursive Definition, Tree basics (up to Oct 13 lecture) |
Examlet 4 | ||||
| Oct 25 | Big-O Algorithms |
chapter 14 | Lecture 15 | |||
| Oct 27 |
|
Algorithms | chapter 15 | Lecture 16 | ||
| Nov 1 | NP | chapter 16 | Lecture 17 | |||
| Nov 3 | Ecamlet 5: Trees, Big-O, Algorithms | Examlet 5 | ||||
| Nov 8 | Contradiction |
chapter 17 | Lecture 18 | |||
| Nov 10 |
|
Collections of Sets | chapter 18 | Lecture 19 | ||
| Nov 15 | State Diagrams | chapter 19 | Lecture 20 | |||
| Nov 17 |
Examlet 6: NP, Contradiction, Collection of Sets |
Examlet 6 | ||||
| Nov 22 | Relaxing | |||||
| Nov 24 | Eating tofurky and cranberry | |||||
| Nov 29 | Countability | chapter 20 | Lecture 21 | |||
| Dec 1 |
|
Computability, Halting Problem, Undecidability | Lecture 22 | |||
| Dec 6 | Planar Graphs, Review, Other topics |
|||||
| Dec 8 | Reading day | |||||
| Dec 15? | Short Final including chapter 19-21, review questions. Examlet retake 7-10pm |
Exam date tentative: will be officially announced by Registrar's office |