COMP 400E: Discrete Structures
About
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, probability, Boolean algebra, logic circuits, and automata.
Warning
This class cannot be used towards the degree requirements for the MS programs. This class is intended as a preparatory course for graduate students without prior programming experience
Description
This course provides the mathematical foundations for graduate-level study in computer science, including such topics as complexity of algorithms, modular arithmetic, induction and proof techniques, functions and relations, graph theory, combinatorics, probability, Boolean algebra, logic circuits, finite state machines, automata and tools for algorithm analysis such as recurrence solving and asymptotic notation.
Outcome
The student will be prepared for the study of advanced ideas in computer science, from cryptography to databases to algorithms to computer architecture.
Syllabi
See the Current Course Syllabi.