| n= |
1 |
2 |
3 |
6 |
11 |
22 |
44* |
| 2n= |
2 |
4 |
8 |
64 |
2,048 |
4,194,304 |
17,592,186,044,416 |
| Week |
Day |
Date |
Main Topic |
Homework Problems |
Examination Dates & Content |
| 01 |
M |
AUG/22 |
Multiplicative Principle |
5.1: 1, 11, 23, 47, 57 & study everything that seems unfamiliar | |
| W |
AUG/24 |
Permutations & Combinations | 5.3: 1, 5, 15, 21, 38 & study everything that seems unfamiliar |
|
|
| F |
AUG/26 |
Binomial Coefficients |
5.4: 1, 5, 9, 12, 25 & study everything that seems unfamiliar | ||
| 02 |
M |
AUG/29 |
Generating Functions |
7.4: 1, 5(a-d), 7(a-d), 9a, 9c, 30(a-b) | Homework
& Quiz
#1 AUG/22-AUG/26 |
| W |
AUG/31 |
Generating Functions |
More
on Section 7.4 |
||
| F |
SEP/02 |
Recurrence Relations |
7.1: 1(a-b,d), 5, 11, 19, 35 | ||
| 03 |
M |
SEP/05 |
N/A |
Labor
Day: No classes! |
|
| W |
SEP/07 |
Linear Recursions |
7.2: 1, 3(a-c), 13, 27(a-c), 37 | ||
| F |
SEP/09 |
Linear Recursions |
More
on Section 7.2 |
Homework
& Quiz
#2 AUG/29-SEP/02 |
|
| 04 |
M |
SEP/12 |
Models
of Thought |
1.1:
1, 11, 31, 47, 61 |
|
| W |
SEP/14 |
More
on Models of Thought |
1.2:
1(a-c), 7(a-b), 9(a-c), 27, 41 |
||
| F |
SEP/16 |
Models
of Argument |
1.3:
3, 7, 11, 33, 59 |
||
| 05 |
M |
SEP/19 |
More
on Models of Argument |
1.4:
1, 13, 15(a-d), 27, 45 1.5: 1, 3, 15, 23 |
Homework
& Quiz
#3 SEP/07-SEP/16 |
| W |
SEP/21 |
Proof Methods | 1.6: 1, 17, 27, 37 | ||
| F |
SEP/23 |
More on Proof Methods | 1.7: 3, 11, 23, 40 | ||
| 06 |
M |
SEP/26 |
Set
Theory |
2.1:
1, 7, 20, 23, 31 |
|
| T |
SEP/27 |
Additional
Practice Problems for Exam #1 |
Exam
#1 AUG/22-SEP/23 ECCR 1B51 5-6:30pm |
||
| W |
SEP/28 | More
on Set Theory |
2.2:
1, 11, 29, 45, 57 |
||
| F |
SEP/30 |
Functions |
2.3: 15, 17, 21, 31, 39 & study everything that seems unfamiliar | ||
| 07 |
M |
OCT/03 |
Algorithms |
3.1:
9, 41, 45, 53, 55 |
|
| W |
OCT/05 |
More
on Algorithms |
More
on section 3.1 |
||
| F |
OCT/07 |
Growth
Functions |
3.2:
1, 33, 37, 44, 60 |
Homework
& Quiz
#4 SEP/26-OCT/03 |
|
| 08 |
M |
OCT/10 |
Complexity
of Algorithms |
3.3:
3, 7, 9, 11, 27 |
|
| W |
OCT/12 |
Algorithms
over Integers |
3.4:
5, 9, 17, 27, 31(c) |
||
| F |
OCT/14 |
Greatest
common divisor |
3.5:
15, 17, 19, 25, 32 |
||
| 09 |
M |
OCT/17 |
Prime
Numbers |
3.6:
1, 3, 13, 23, 53 |
Homework
& Quiz
#5 OCT/05-OCT/14 |
| W |
OCT/19 |
More
on Primes |
3.7:
1, 3, 7, 10, 19 |
||
| F |
OCT/21 |
Modular
arithmetic |
n/a |
||
| 10 |
M |
OCT/24 |
Basic
Induction |
4.1:
3, 6, 19, 31, 52 |
|
| W |
OCT/26 |
Strong Induction | 4.2: 3, 11, 21, 27, 33 | ||
| F |
OCT/28 |
More
on Induction |
n/a |
Homework
& Quiz
#6 OCT/17-OCT/24 |
|
| 11 |
M |
OCT/31 |
Recursive
Algorithms |
4.3:
1, 9, 25, 27, 59 |
|
| T |
NOV/01 | Additional
Practice Problems for Exam #2 |
Exam
#2 SEP/26-OCT/28 ECCR 1B51 5-6:30pm |
||
| W |
NOV/02 |
More
on recursive algorithms |
4.4:
7, 11, 19, 24, 44 4.5: read and study section |
||
| F |
NOV/04 |
Pigeonhole
Principle |
5.2:
1, 7, 15, 29, 39 |
||
| 12 |
M |
NOV/07 |
More
on Pigeonhole Princilple |
n/a |
|
| W |
NOV/09 |
Divide-and-Conquer algorithms | 7.3: 9, 17, 21 | ||
| F |
NOV/11 |
Divide-and-Conquer recursions | n/a | ||
| 13 |
M |
NOV/14 |
Inclusion-Exclusion method | 7.5: 1, 3, 5, 9, 13 | Homework
& Quiz
#7 OCT/31-NOV/11 |
| W |
NOV/16 |
More on Inclusion-Exclusion | 7.6: 3, 6, 13, 22, 25 | ||
| F |
NOV/18 |
Graphs |
9.1:
3, 5, 7, 9, 13 |
||
| 14 |
M |
NOV/21 |
N/A | Fall
Break: No classes! |
|
| W |
NOV/23 |
N/A | Fall Break: No classes! | ||
| F |
NOV/25 |
N/A | Fall Break: No classes! | ||
| 15 |
M |
NOV/28 |
Special
types of graphs |
9.2:
1, 5, 9, 21, 25 |
|
| W |
NOV/30 |
More
on special types of graphs |
n/a |
Homework
& Quiz
#8 NOV/14-NOV/18 |
|
| F |
DEC/02 |
Graph
isomorphisms |
9.3:
1, 11, 13, 17,19, 25, 35, 39 |
||
| 16 |
M |
DEC/05 |
More on graph isomorphisms | n/a |
|
| W |
DEC/07 |
Connectivity |
9.4:
1, 11, 17, 19, 25 |
||
| F |
DEC/09 |
Euler
and Hamilton Paths |
9.5:
5, 7, 10, 31, 33 |
||
| 17 | S |
DEC/10 |
Additional
Practice Problems for Exam #3 |
Exam
#3 OCT/31-DEC/09 @ ECCR 110 5-6:30pm |