Discrete Mathematics for Computing I

CISC 102/3.0

Overview

Introduction to mathematical discourse and proof methods. Sets, functions, sequences, and relations. Properties of the integers. Induction. Equivalence relations. Linear and partial orderings. 

Learning Outcomes

Upon successful completion of this course students will be able to:

  1. Apply standard Mathematics notation used in the field of Computing.
  2. Recognize the difference between a proof and a counter example.
  3. Able to formulate elementary proofs using mathematical induction.
  4. Recognize comparative magnitudes of functions such as log(n), n2, 2n.
  5. Ability to read and understand some elementary logical proofs.

Topics

  • Sets theory
  • Logic
  • Relations
  • Functions
  • Induction
  • Properties of Integers
  • Primes
  • GCD
  • LCD
  • Modular Arithmetic
  • Equivalence Relations
  • Binomial Coefficients
  • Advanced counting
  • Recurrences
  • Methods of proof