Discrete Structures
This course covers the mathematical foundations of computer science, including such topics as complexity of algorithms, modular arithmetic, induction and proof techniques, graph theory, combinatorics, Boolean algebra, logic circuits, and automata.
Prerequisite: MATH 117 or placement.
Outcomes: The student will be prepared for the study of advanced ideas in computer science, from cryptography to databases to algorithms to computer architecture.
This course covers the mathematical foundations of computer science, including such topics as complexity of algorithms, modular arithmetic, induction and proof techniques, graph theory, combinatorics, Boolean algebra, logic circuits, and automata.
Prerequisite: MATH 117 or placement.
Outcomes: The student will be prepared for the study of advanced ideas in computer science, from cryptography to databases to algorithms to computer architecture.
Restricted to Undergraduate Students
Pre-requisite: MATH 117 or placement
This course is primarily intended to serve certain majors and minors. Students wishing to satisfy Core requirements in the Quantitative Analysis knowledge area are encouraged to enroll in COMP 125 or COMP 150 instead.
This course is restricted to undergraduate students. Graduate students wishing to enroll in a section of this course should contact their departmental graduate advisor.
Class Details
Class Availability
Combined Section Capacity
Combined Section