|
|
Schedule: CSE 2813-02 Discrete Structures, Spring 2009
All dates are tentative except for the final exam date. I will
adjust this schedule as the semester progresses.
| Week |
Class Dates |
Events |
Lecture Topics and Reading
Assignments |
| 1 |
Thu, Jan 8 |
|
Class Overview
1.1 Logic |
| 2 |
Tue, Jan 13 |
|
1.2 Propositional Equivalences
1.3 Predicates and Quantifiers
|
| Thu, Jan 15 |
Quiz #1 |
| 3 |
Tue, Jan 20 |
|
1.4 Nested Quantifiers
1.5 Rules of Inference
|
| Thu, Jan 22 |
Quiz #2 |
| 4 |
Tue, Jan 27 |
|
1.6 Introduction to Proofs
2.1 Sets
|
| Thu, Jan 29 |
Quiz #3 |
| 5 |
Tue, Feb 3 |
|
2.2 Set Operations
2.3 Functions
|
| Thu, Feb 5 |
Exam #1 |
| 6 |
Tue, Feb 10 |
|
2.4 Sequences and Summations
3.1 Algorithms
3.2 Growth of Functions
|
| Thu, Feb 12 |
Quiz #4 |
| 7 |
Tue, Feb 17 |
|
3.2 Growth of Functions (con’t)
3.3 Complexity of Algorithms
4.1 Mathematical Induction
|
| Thu, Feb 19 |
Quiz #5 |
| 8 |
Tue, Feb 24 |
|
4.1 Mathematical Induction (con't)
4.2 Strong Induction
4.3 Recursive Definitions
|
| Thu, Feb 26 |
Quiz #6 |
| 9 |
Tue, Mar 3 |
|
4.3 Recursive Definitions (con't)
5.1 Basics of Counting
|
| Thu, Mar 5 |
Exam #2 |
| 10 |
Tue, Mar 10 |
|
5.2 The Pigeonhole Principle
5.3 Permutations and Combinations
|
| Thu, Mar 12 |
|
| |
Tue, Mar 17 |
|
(Spring Break) |
| Thu, Mar 19 |
|
| 11 |
Tue, Mar 24 |
|
5.3 Permutations and Combinations (con't)
7.1 Recurrence
Relations, Tower of Hanoi
|
| Thu, Mar 26 |
Quiz #7 |
| 12 |
Tue, Mar 31 |
|
7.1 Recurrence Relations, Tower of Hanoi (con't)
8.1 Relations and Their Properties
8.3 Representing Relations
|
| Thu, Apr 2 |
Quiz #8 |
| 13 |
Tue, Apr 7 |
|
8.4 Closures of Relations
8.5 Equivalence Relations |
| Thu, Apr 9 |
Exam #3 |
| 14 |
Tue, Apr 14 |
|
9.1 Introduction to Graphs
9.2 Graph Terminology
9.3 Representing Graphs and Graph Isomorphism |
| Thu, Apr 16 |
Quiz #9 |
| 15 |
Tue, Apr 21 |
|
9.4 Connectivity |
| Thu, Apr 23 |
Final Review |
| 16 |
Wed, Apr 29 |
Final Exam |
3 – 6 pm, Butler 100 |
Last Modified:
August 06, 2012
|