Discrete Mathematics

This course focuses on the theory and application of mathematical principles critical to the computing sciences. Students study and apply key concepts in topics such as set theory, combinatorics, language and grammars, propositional and quantifier logic, boolean functions and circuit design, growth of functions and big-O notation, time complexity of algorithms, mathematical induction and program correctness, recursive definitions and recursive algorithms and solving recurrence relations.

UG - Undergraduate

N - Course May Not Be Repeated