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
Course Learning Outcomes:
1. Translate and interpret symbolic logic and apply to language and mathematical proof.
2. Describe sets and set operations, identify properties of functions, categorize sequences, and compute values of summantions.
3. Identify various growth rates of functions and categorize algorithms using Big-O notation.
4. Apply concepts of congruence to such things as modular arithmatic, number theory, and cryptography.
5. Apply methods of counting to problems involving permutations and combinations.
6. Apply concepts of graph theory including optimization of paths and circuits and applications with trees.
7. Apply concepts of Boolean algebra to construct logic gates and minimize circuits. *Optional if time permits