Introduction to Discrete Mathematics – MATH 250

CG • Section 8WK • 11/08/2019 to 04/16/2020 • Modified 04/05/2022

Course Description

Logic and proofs, set theory, Boolean algebra, functions, sequences, matrices, algorithms, modular arithmetic, mathematical induction and combinatorics.

For information regarding prerequisites for this course, please refer to the Academic Course Catalog.


Discrete mathematics, the study of finite mathematical systems, provides students with mathematical ideas, notations and skills which are critical to, for example, formulating what an algorithm is supposed to achieve, proving if it meets the specification, and analyzing its time and space complexity. Discrete mathematics is essential to the study of computer science.

Measurable Learning Outcomes

Upon successful completion of this course, the student will be able to:

  1. Construct valid mathematical arguments using logical connectives and quantifiers.
  2. Verify the correctness of a mathematical argument using symbolic logic and truth tables.
  3. Construct a proof using direct proof, proof by contradiction, and proof by cases.
  4. Perform operations on discrete structures such as sets, discrete functions, relations, sequences, and matrices.
  5. Analyze algorithms, determine algorithmic complexity, and apply algorithms to solve problems.
  6. Express a Boolean function as a Boolean sum of Boolean products of the variables and their complements.
  7. Use Boolean algebra to model the circuitry of electronic devices.
  8. Use relations to solve problems involving communications networks, project scheduling.

Course Assignment

After reading the Course Syllabus and Student Expectations, the student will complete the related checklist found in the Course Overview.

The student will complete reading assignments within the McGraw Hill Connect software associated with the textbook

The student will complete handwritten homework assignments and submit them in Canvas each week.

Each quiz will cover the Learn material for the assigned modules. Each quiz will be open-book/open-notes, have a 1 hour time limit, and be completed in McGraw Hill Connect software.

The student will complete quizzes: written exams during Modules 2, 4, 6, and 8. Each written exam will be open-book/open-notes, cover 2 modules of material, and have a 2 hour time limit. All written exams will be handwritten and submitted in Canvas.