|
Week |
Chapter |
Tentative Topics |
Assignment/Exam |
| 1 |
1 |
Logic, Propositional Equivalences, Predicates and
Quantifiers
(Ch.
1.1.ppt)(Ch.
1.2.ppt)(Ch.
1.3-4.ppt)
(Ch.
1.1.pdf)(Ch.
1.2.pdf)(Ch.
1.3-4.pdf) |
HW 1 |
| 2 |
1 |
Methods of Proof, Proof Strategy
(Ch.1.5.ppt)
(Ch.1.6-7.ppt)
(Ch.1.5.pdf)
(Ch.1.6-7.pdf) |
CW 1 |
| 3 |
2 |
Sets, Set Operations
(Ch.2.1.ppt)
(Ch.2.2.ppt)
(Ch.2.1.pdf)
(Ch.2.2.pdf)
|
HW 2 |
| 4 |
2 |
Functions, Sequences and Summation
(Ch.2.3.ppt)
(Ch.2.4.ppt)
(Ch.2.3.pdf)
(Ch.2.4.pdf) |
CW 2 |
| 5 |
3 |
Algorithms, Growth of Functions, Complexity of
Algorithms
(Ch.3.1.ppt)
(Ch.3.2.ppt)
(Ch.3.3.ppt)
(Ch.3.1.pdf) (Ch.3.2.pdf) (Ch.3.3.pdf) |
HW 3 |
| 6 |
3 |
Integers and Division, Applications of Number
Theory
(Ch.3.4-5.ppt)
(Ch.3.4-5.pdf) |
CW 3,
Project Group Formation Deadline |
| 7 |
3 |
Integers and Algorithms, Matrices
(Ch.3.6-7.ppt)
(Ch.3.8.ppt)
(Ch.3.6-7.pdf) (Ch.3.8.pdf) |
Exam I
& Project Assignment, HW4 |
| 8 |
4 |
Mathematical Induction, Proofs by Induction
(Ch.4.1.ppt)(Ch.4.1.pdf) |
CW 4 |
| 9 |
5 |
The Basics of Counting, Pigeonhole Principle, Permutations and Combinations, Binomial Coefficients
(Ch.5.1-4.ppt)
(Ch.5.1-4.pdf) |
HW 5 |
| 10 |
6-7 |
Discrete Probability, Probability Theory, Expected
Value and Variance, Recurrence Relations
(Ch.6-7.ppt)
(Ch.6-7.pdf) |
CW 5 |
| 11 |
8 |
Relations
(Ch.8.1.ppt)
(Ch.8.1.pdf)
|
HW 6 |
| 12 |
8 |
n-ary Relations, Representing Relations, Closures, Equivalence Relations, Partial Orderings
(Ch.8.2-6.ppt)
(Ch.8.2-6.pdf) |
Exam II & CW 6 |
| 13 |
11 |
Boolean Functions, Representing Boolean Functions,
Logic Gates
(Ch.11.ppt)
(Ch.11.pdf) |
HW 7 |
| 14 |
12 |
Finite State Machines
(Ch.12.ppt)
(Ch.12.pdf) |
CW 7 |