CSE 210 -- Discrete Mathematics -- Fall 2004
Lecture Schedule (subject to revision)
- WEEK 1: Aug 23 - 27
- REGISTRATION DAY
- Introduction to Sets (1.6)
- Set Operations (1.7)
- WEEK 2: Aug 30 - Sep 3
- Functions (1.8) & Recursive Definitions (3.4)
- Introductions to Algorithms (2.1)
- Growth Functions (2.2)
- WEEK 3: Sep 6 - 10
- Complexity of Algorithms (2.3)
- Integers & Division (2.4)
- Integers & Algorithms (2.5)
- WEEK 4: Sep 13 - 17
- Number Theory Applications: Encryption (2.6)
- Logic (1.1)
- Logical Equivalence (1.2)
- WEEK 5: Sep 20 - 24
- Predicates & Quantifiers (1.3)
- MIDTERM #1 (in class)
- Methods of Proof (1.5)
- WEEK 6: Sep 27 - Oct 1
- Sequences & Summations (3.2)
- Mathematical Induction (3.3)
- Strong Induction (3.3)
- WEEK 7: Oct 4 - 8
- Program Correctness (3.6)
- Counting (4.1)
- Pigeonhole Principle (4.2)
- WEEK 8: 11 - 15
- Permutations & Combinations (4.3)
- Discrete Probability (5.1)
- Probability Theory (5.2)
- WEEK 9: Oct 18 - 22
- MID SEMESTER BREAK
- MID SEMESTER BREAK
- MID SEMESTER BREAK
- WEEK 10: Oct 25 - 29
- Boolean Functions (10.1)
- Representing Boolean Functions (10.2)
- Logic Gates (10.3)
- WEEK 11: Nov 1 - 5
- Languages & Grammars (11.1)
- MIDTERM #2 (in class)
- Finite State Machines with output (11.2)
- WEEK 12: Nov 8 - 12
- Finite State Machines without output (11.3)
- Language recognition (11.4)
- Turing Machines (11.5) & Halting Problem (3.1)
- WEEK 13: Nov 15 - 19
- Recurrence Relations (6.1)
- Divide & Conquer Algorithms (6.3)
- Introduction to Graphs (8.1) & Graph Terminology (8.2)
- WEEK 14: Nov 22 - 26
- Representing Graphs & Isomorphism (8.3)
- Connectivity (8.4)
- THANKSGIVING BREAK
- WEEK 15: Nov 29 - Dec 3
- Euler & Hamilton Paths (8.5)
- Trees (9.1)
- Tree Traversals (9.3)
- WEEK 16: Dec 6 - 10
- Spanning Trees (9.4 & 9.5)
- Course Review
- READING DAY
- EXAM (Wednesday, 12/17/2004, 8:00AM - 10:00AM
Page maintained by John H Stewman
Last modified: 8/18/2004