Discrete Computational Structures

Catalog description

This course introduces mathematical reasoning and proof with an emphasis on its role in computation. Propositional and first-order logic are presented along with methods of formal proof with applications to sets, functions, and relations. Mathematical induction and its relationship to recursion are emphasized. Additional topics include combinatorics, discrete probability, and basic graph theory. Prerequisite: CS 120 ; MTH 151 ; concurrent enrollment in CS 220 ; declared computer science major or minor. Course not open to those who have completed MTH 225 . Offered Fall, Spring.