Discrete Structures

Prerequisites

C or better in MATH 151 (Calculus and Analytic Geometry I) or MATH 140 (Differential Calculus)

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; and recurrences.

Course Outcomes

1. An in depth introduction to Discrete Mathematics, providing the student with sufficient understanding and skills to continue to learn and work with new discrete math concepts encountered in future courses.
2. Basic skills in understanding and constructing mathematical proofs.
3. A rudimentary understanding on how the discrete math encountered in this course fits within the greater context of computer science and mathematics.

Program Outcomes

Text

Either one of

• Susanna Epps, Discrete Mathematics with Applications, Brooks Cole, 2003.
• Kenneth Rosen, Discrete Mathematics and its Applications, McGraw-Hill, 1998

Topics

• The propositional calculus
• The first order predicate calculus
• Proof methods using elementary number theory
• Mathematical induction
• Set theory
• Counting without counting
• Relations

Grading

Updated June 6, 2012