Introduction to Discrete Structures

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.

Review Summary

Clarity
N/A
Organization
N/A
Time
N/A
Overall
N/A

Enrollment Progress

Enrollment data not available.

Course

Instructor
Jeffrey Lindquist
Previously taught
17Su

Previous Grades

Grade distributions not available.