CSCI 201 - Discrete Math and Functional Programming for Computer Scientists

This course provides a rigorous introduction to the mathematical structures and reasoning techniques underlying computer science. Topics include sets, functions, relations, graphs, trees, and finite automata, with an emphasis on formal definitions and logical precision. Students will develop proficiency in constructing mathematical proofs using direct, contrapositive, contradiction, and inductive methods. Functional programming is introduced as a vehicle for expressing computation and recursion within a mathematically grounded framework.

Prerequisites & Notes: CSCI 145; MATH 124, MATH 134 or MATH 138.
Credits: 4
Grade Mode: Letter