Math 2603 - Fall 2019
Introduction to Discrete Mathematics
Syllabus
Lecture Slides
- Lecture 1 - Chapter 0
- Lecture 2 - Chapter 1
- Lecture 3 - Section 1.3, Section 2.1 & 2.2
- Lecture 4 - Section 2.3 & 2.4 Relations
- Lecture 5 - Section 3.1 & 3.2 Functions
- Lecture 6 - Section 3.3 Bijections and cardinality
- Lecture 7 - Section 4.1 - 4.3 Division
- Lecture 8 - Section 4.4 & 4.5 Congruences
- Lecture 9 - Section 5.1 Mathematical Induction
- Lecture 10 - Section 5.2 & 5.3 recursively defined sequences
- Lecture 11 - Section 8.1 & 8.2 Algorithms
- Lecture 12 - Section 8.3 searching & sorting
- Lecture 13 - Section 6.1 & 6.2 principles of counting
- Lecture 14 - Section 6.3 & 7.1 Pigeonhole principle and permutations
- Lecture 15 - Section 7.2 & 7.7 Combinations and the Binomial Theorem
- Lecture 16 - Section 7.3 & 7.4 Probability Theory
- Lecture 17 - Section 7.5 & 7.6 Repetitions and derangements
- Lecture 18 - Section 9.1 & 9.2 Graph Theory
- Lecture 19 - Section 9.3 Isomorphism of Graphs
- Lecture 20 - Section 10.1 & 10.2 Eulerian circuits and Hamiltonian cycles
- Lecture 21 - Section 10.4 Shortest path algorithms
- Lecture 22 - Section 12.1 & 12.2 Trees
- Lecture 23 - Section 12.3 & 12.5 Minimal Spanning Trees & Depth-First Search
- Lecture 24 - Section 13.1 Planar Graphs
- Lecture 25 - Section 13.2 Coloring Graphs
- Lecture 26 - Section 14.1 & 14.2 The Max Flow-Min Cut Theorem
