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 and problem solving strategies.
- Boolean algebra
- Set theory
- Symbolic logic
- Predicate calculus
- Number theory
- Objective functions
- Equivalence relations
- Set partitions
- Modular arithmetic
Students should have completed a college-level calculus course with a grade of B or better.
E-mail firstname.lastname@example.org or call (443) 692-6599:
- if you have any questions about this course,
- to be notified when this course and any closely related courses are scheduled for open enrollment,
- to request a quote for group training at your location or ours.