Hisham Ladha

COMP 232 Concordia - Discrete Math for Computer Science

Download my notes for free!

Topics

Topics may differ depending on your professor.

When I took the course back in 2023, the topics included:

  1. Propositional Logic
  2. Predicates and Quantifiers
  3. Nested Quantifiers
  4. Inference and Proof
  5. Proof Strategy
  6. Proofs, Sets
  7. Functions, Cardinality of Sets
  8. Elements of Number Theory
  9. Primes and GCD's
  10. Mathematical Induction
  11. Recursive Definition, Relations
  12. Closures of Relations
  13. Equivalence Relations, Partial Orderings

The course followed the textbook "Discrete Mathematics and its Applications (8th ed), 2019. Kenneth H. Rosen. McGraw Hill".

How to study

A few topics that will almost certainly come in your final exam

  1. Propositional logic (working through and simplifying long examples)
  2. Translating english to propositional logic and vis versa
  3. Proof techniques (making you prove or disprove certain statements with propositional logic)
  4. Classifying functions
  5. Relations and closures

My Thoughts

Discrete Math is arguably one of the most divisive courses in a computer science degree, according to my experience. Most students hate it and yet, it is vital to understanding the underlying workings of computers. Part of this hate comes from either: poor learning and understanding or teaching, poor examination strategies and lack of practice. I recommend putting a lot of effort and practice towards this course if you are learning the concepts covered here for the first time.

#Concordia