Course DescriptionIntroduction to discrete structures as they apply to design and analysis. Review of proof techniques. Induction and recursion. Graphs and trees, and their applications in computing. Finite automata and regular expressions. Counting: arithmetic and geometric progressions, permutations and combinations, modular arithmetic.
- Computer Coding (Formerly Computer Programming Applications) : Electives (select 2)