► ProgramsDiscrete Math for Computer Science

Discrete Math for Computer Science


This course introduces the fundamental tools, topics and concepts of discrete mathematics needed to study computer science. This course emphasizes counting methods, proof techniques and problem solving strategies.


  • Boolean algebra
  • Set theory
  • Symbolic logic
  • Predicate calculus
  • Number theory
  • The methods of direct, indirect and inductive proofs
  • Objective functions
  • Equivalence relations
  • Graphs
  • Set partitions
  • Combinatorics
  • Modular arithmetic
  • Summations
  • Recurrences

The course will provide a comprehensive introduction to each of these steps using practical applications. The emphasis will be on the foundation of the data mining techniques.


Students should have completed a college-level calculus course with a grade of B or better.


5 days

Group Training Available

UMBC Training Centers can deliver any of our courses in a group training environment at our facilities or yours. Group training can be an effective and economical method to quickly assure competency and consistency of knowledge and skills within an organization or department.