Discrete Mathematical Structures

Catalog description

Designed for majors in mathematics and computer science, this course provides an introduction to discrete mathematical structures used in Computer Science and their applications. Course content includes: Propositional and predicate logic; rules of inference; quantifiers; elements of integer number theory; set theory; methods of proof; induction; combinatorics and discrete probability; functions and relations; recursive definitions and recurrence relations; elements of graph theory and trees. Applications include: analysis of algorithms, Boolean algebras and digital logic circuits. Students may receive credit for CS 17 or MATH 10, but not both. 72 hours lecture, 18 hours laboratory. ADGE: 2; Transfer: CSU, UC; Cal- GETC: 2; C-ID# COMP 152. Prerequisite: MATH 1 with a minimum grade of C (May be taken concurrently). CS 1 with a minimum grade of C (May be taken concurrently).