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.
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.