Skip to Content
Home /  Courses And Programs / Discrete Math: Problem Solving for Engineering, Programming, & Science

Discrete Math: Problem Solving for Engineering, Programming, & Science

Discrete mathematics is used to solve certain types of math problems, such as how to count or enumerate quantities, and to describe their properties and the relationships among them. Discrete math is applied math: it provides the basis for much of computer science, statistics, and programming, as well as being integral to engineering and many different scientific disciplines. Discrete math helps to find solutions to every day, real-world problems.

In this course, students are introduced to the fundamental concepts and cover some of the essential techniques of discrete mathematics. With emphasis on the problem solving and a very hands-on approach, students will master concepts and techniques such as number theory and graph theory.

Topics Include:

  • Logic
  • Ordering and sequences
  • Integer functions
  • Divisibility and primes
  • Graphs and trees
  • Counting and probability
  • Asymptotics

Practical Experience:

  • Apply graph ideas to model simple situations
  • Compute probability of some simple events
  • Verify the correctness of an argument using truth tables
  • Describe some simple expressions using big-O notation

Course Typically Offered: Online, quarterly.

Prerequisites: Strong understanding of college algebra.

Next Steps: Upon completion, consider additional Applied Mathematics coursework for continued learning.

More Information: Please contact

Course Number: CSE-41243
Credit: 3.00 unit(s)

+ Expand All