CSC 1300: Lecture Notes
- 1.1 Logic
- 1.2 Propositional Equivalences
- 1.3 Predicates and Quantifiers
- 1.4 Sets
- 1.5 Set Operations
- 1.6 Functions
- 1.7 Sequences and Summations
- 2.3 The Integers and Division
- 2.4 Integers and Algorithms
- 2.6 Matrices
- 3.1 Methods of Proof
- 3.2 Mathematical Induction
- 3.3 Recursive Definitions
- 4.1 The Basics of Counting
- 4.2 The Pigeonhole Principle
- 4.3 Permutations and Combinations
- 4.4 Discrete Probability
- 5.1 Recurrence Relations
- 5.5 Inclusion-Exclusion
- 6.1 Relations and their Properties
- 6.3 Representing Relations
- 6.5 Equivalence Relations
- 7.1 Introduction to Graphs
- 7.2 Graph Terminology
- 7.3 Representing Graphs and Graph Isomorphism
- 7.4 Connectivity
- 7.5 Euler and Hamilton Paths
- 8.1 Introduction to Trees
Course Home Page |
Instructor's Home Page