Description

Lecture, three hours; discussion, one hour. Requisites: courses 31A, 31B. Not open for credit to students with credit for course 180 or 184. Discrete structures commonly used in computer science and mathematics, including sets and relations, permutations and combinations, graphs and trees, induction. P/NP or letter grading.

Instructional Format

Primary Format

Lecture

Secondary Format

Discussion

Credit Exclusions

MATH 184 - Enumerative Combinatorics
MATH 180 - Graph Theory

Not open for credit to students with credit for any course listed here.