CSC 1300: Lecture Notes


  1. 1.1 Logic
  2. 1.2 Propositional Equivalences
  3. 1.3 Predicates and Quantifiers
  4. 1.4 Sets
  5. 1.5 Set Operations
  6. 1.6 Functions
  7. 1.7 Sequences and Summations
  8. 2.3 The Integers and Division
  9. 2.4 Integers and Algorithms
  10. 2.6 Matrices
  11. 3.1 Methods of Proof
  12. 3.2 Mathematical Induction
  13. 3.3 Recursive Definitions
  14. 4.1 The Basics of Counting
  15. 4.2 The Pigeonhole Principle
  16. 4.3 Permutations and Combinations
  17. 4.4 Discrete Probability
  18. 5.1 Recurrence Relations
  19. 5.5 Inclusion-Exclusion
  20. 6.1 Relations and their Properties
  21. 6.3 Representing Relations
  22. 6.5 Equivalence Relations
  23. 7.1 Introduction to Graphs
  24. 7.2 Graph Terminology
  25. 7.3 Representing Graphs and Graph Isomorphism
  26. 7.4 Connectivity
  27. 7.5 Euler and Hamilton Paths
  28. 8.1 Introduction to Trees


Course Home Page | Instructor's Home Page