MATH 250 - Discrete Structures

3 Credits
This course applies fundamental ideas in discrete structures and mathematical reasoning. Topics include elementary logic and set theory, functions and relations, induction and recursion, elementary algorithm analysis, counting techniques, and introduction to computability. Fundamental techniques include graph theory, Boolean algebra, and trees. Techniques and topics will form the foundation for subsequent programming language courses.

Prerequisite(s): CISP 111, MATH 130 or MATH 135 or MATH 150