CSS 220 Discrete Structures

This course introduces students to the mathematical structures and properties that are necessary in fields such as computer science, data analysis, and information security. Topics include the underlying mathematics for algorithms used for sorting, designing high-speed networks and message routing paths, formalizing security requirements, and analyzing algorithms for correctness and efficiency. This course covers areas in discrete mathematics including sets, functions, and relations; proof techniques and induction; number theory; and probability. Pre-requisite(s): MTH 102 (or higher) and CSS 225, or Permission of Program Chair or designate. Co-requisite(s): None. 5 quarter hours