► ProgramsDiscrete Math for Computer Science

Discrete Math for Computer Science

Overview

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.

Topics

  • 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.

Prerequisites

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

Schedule

5 days




Alert Me

If you would like to be notified of future classes for this course, please click on Alert Me and complete the short form.

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.
© 2014 UMBC Training Centers, 6996 Columbia Gateway Drive, Suite 100, Columbia, MD 21046 ipR.gif 443-692-6600