Read our cookies policy and privacy statement for more information.
×Rocklin, California•
Introduction to the essential discrete structures used in Computer Science, with emphasis on their applications. Includes elementary formal logic and set theory, elementary combinatorics, recursive programming and algorithm analysis, Boolean algebra, digital logic, combinatorial circuits, graph theory, circuit design and minimization, and computer arithmetic. (C-ID COMP 152) (CSU, UC)
Units: 3.0
Hours: 72 (54 lecture, 18 laboratory)