Department of Mathematics and Statistics
Math 241 (Discrete Mathematics)
Semester: Second Year: 2001/2002
| Week | Section | Subject | |
| 1 | Introduction to Discrete Mathematics | ||
| 1.1 | Sets, Definition and Notations. | ||
| 2 | 1.2 | Operations on Sets, Properties of Sets | |
| 1.5 | Review of Matrices | ||
| 3 | Appendix A | Algorithms and Pseudocode. | |
| 4 | 2.1 | Propositions and Logical Operations | |
| 2.2 | Predicates, Quantifiers, Conditional Statements | ||
| 5 | 2.3 | Methods of Proofs, Formal Proof | |
| 2.4 | Mathematical Inductions. | ||
| 6 | 4.1 | Product Sets and Partitions | |
| 4.2 | Relations and Digraphs | ||
| 7 | 4.3 | Paths in Relations and Digraphs | |
| 4.4 | Properties of Relations and Digraphs | ||
| 4.5 | Equivalence Relations | ||
| 8 | 4.6 | Computer Representations of Relations and Digraphs | |
| 4.7, 4.8 | Operations on Relations, Transitive Closure. | ||
| 9 | 5.1 | Functions | |
| 5.2 | Functions for Computer Science | ||
| 10 | 5.3 | Growth of Functions | |
| 5.4 | Permutation Functions. | ||
| 11 | 7.1, 7.2 | Trees: Labeled Trees | |
| 12 | 7.3 | Tree Searching | |
| 13 | 7.4 | Undirected Trees, Spanning Trees | |
| 7.5 | Minimal Spanning trees. | ||
| 14 | 9.1 | Semigroup, Homomorphism and Isomorphism | |
| 15 | 9.3 | Groups | |
| 16 | Final exams |
|
Previous Exams
_______________