CS 17 - Discrete Mathematical Structures

Recent Professors: WILLIAM LAM, THOMAS KIM, SETH LAVENDER, RACHAEL WEBSTER
Recent Semesters: Fall 2026, Spring 2026, Fall 2025, Spring 2025, Fall 2024
Class Size: 35 students
Credits: 4
Prerequisite: Prerequisite(s): All prerequisites must be completed with a minimum grade of "C" (or "P") or higher. CS 1, (may be taken concurrently) MATH 1, (may be taken concurrently)
Fall 2026 Sections: View Fall 2026 sections of CS 17
Transfers To: UC and CSUCal-GETC Area 2 · IGETC Area 2A · CSU GE Area B4
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.
Usually Held: Thu 8:30am–9:45am, Thu 9:55am–10:45am, Tue 8:30am–10:45am, Mon 6:30pm–8:45pm