Engineering Home

Course Description

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 Include:

• 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

Course Prerequisites

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

Schedule

40 hours

Contact Information

E-mail Heith Hart or call (443) 692-6599 if you have any questions about this course or if you would like to be added to the interest list.