DISCRETE STRUCTURES AND FUNCTIONAL PROGRAMMING

Catalog description

Sets, propositional and predicate logic, the nature of proof and proof techniques, induction, relations, functions, counting and combinatorics, and higher-order functions and currying. Introduction to number systems, Boolean algebra, and computing machines (logic gates and combinational circuits). Representation of discrete structures and implementation of associated operations using functional programming. Prerequisite: CSCI 151 with a grade of no less than a B. This course fulfills a MATH elective for mathematics majors.