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 my estimated schedule.
Before each lecture, you are expected to do the reading assignment from the corresponding sections in the Rosen textbook.
|
Date |
Topic |
Pre-lecture readings |
Notes from lecture |
|
1/11 |
Introduction |
||
|
1/13 |
Logic: Propositional Logic |
1.1, 1.2, 1.3 |
|
| 1/18 | Martin Luther King, Jr. Day - No Class | ||
|
1/20 |
More Logic: Predicate Logic, Quantifiers, etc. |
1.4, 1.5. 1.6 |
|
|
1/25 |
Proofs |
1.7, 1.8 |
|
|
1/27 |
Number Theory |
4.1, 4.3 |
|
|
2/1 |
Number Theory: Congruences, Rationals, Reals |
4.4, 4.5, 4.6 |
|
|
2/3 |
Sets |
2.1, 2.2, 2.5, 2.6 |
|
|
2/8 |
Function Intro, Relations |
2.3, 9.1, 9.3, 9.4, 9.5 |
|
|
2/10 |
Relations, Sequence and summations |
2.4 |
|
|
2/15 |
Tentative first Midterm |
||
|
2/17 |
Relations, Sequence and summations |
2.4 |
|
|
2/22 |
Induction |
5.1, 5.2, |
|
|
2/24 |
Induction; Recursive Definitions |
5.3, 5.4 |
Lecture 9 |
|
2/29 |
Counting; Pigeonhole Principle, Generating Function |
6.1, 6.2, 6.3, 6.4, 6.5 |
|
|
3/2 |
Counting, advanced |
|
|
|
3/7 |
Probability |
7.1, 7.2, 7.3, 7.4 |
|
|
3/9 |
Probability, Bayesian |
7.1, 7.2, 7.3, 7.4 |
|
| 3/14-19 | Spring Break Week - No Classes | ||
|
3/21 |
Trees |
11.1, 11.2, 11.3 |
|
|
3/24 |
Graphs |
10.1, 10.2, 10.3, 10.4 |
|
|
3/28 |
Tentative Second Midterm |
||
|
3/30 |
Graphs |
10.1, 10.2, 10.3, 10.4 |
|
|
4/4 |
Algorithms |
3.1, 3.2, 3.3 |
|
|
4/6 |
Shortest Paths |
10.6, |
|
| 4/11 | Minimum Spanning Tree | 11.5 | Lecture MST |
|
4/13 |
Intro to more algorithms (sorting) |
|
|
|
4/18 |
Model of Computation |
13.1, 13.2, 13.3 |
|
|
4/20 |
Model of Computation (FSM) |
13.4, 13.5 |
|
|
4/25 |
Turing Machine, P and NP |
13.5 |
|
|
4/27 |
Review for final exam |
||
|
5/2-7 |
Final EXAM WEEK |
|