MATH 215

Discrete Mathematics

4 Undergraduate credits
Effective August 1, 1998 – Present

Graduation requirements this course fulfills

This course covers a variety of important topics in math and computer science. Topics include: logic and proof, sets and functions, induction and recursion, elementary number theory, counting and probability, and basic theory of directed graphs.

Special information

Note: Students whose prerequisites are not identified by the system should contact the Math and Statistics department for an override at MATH@metrostate.edu.

Learning outcomes

General

  • Understand fundamental combinatorics principles including permutations and combinations and apply them to discrete probability problems.
  • Understand recursive algorithms and their applications.
  • Understand symbolic logic and predicate calculus. Master methods of proof including direct proof, proof by contradiction and mathematical induction.
  • Understand the fundamentals of elementary number theory including the Euclidean algorithm and number systems. Understand the notion of an algorithm.
  • Understand functions, relations and directed graphs.

Spring 2020

Section Title Instructor
01 Discrete Mathematics Mortabit, Abdessamad Books Course details
02 Discrete Mathematics Gardner, Matthew R Books Course details
03 Discrete Mathematics Mortabit, Abdessamad Books Course details
04 Discrete Mathematics Naughton, Gerry P Books Course details

Summer 2020

Section Title Instructor
01 Discrete Mathematics Mortabit, Abdessamad Books Course details
02 Discrete Mathematics Mortabit, Abdessamad Books Course details

Fall 2020

Section Title Instructor
01 Discrete Mathematics Mortabit, Abdessamad Books Course details
02 Discrete Mathematics Naughton, Gerry P Books Course details
03 Discrete Mathematics Mortabit, Abdessamad Books Course details
04 Discrete Mathematics Staff, Staff Books Course details
05 Discrete Mathematics Staff, Staff Books Course details
50 Discrete Mathematics Mortabit, Abdessamad Books Course details