COSC 200 - Discrete Structures for Computer Science (4)

Introduction to discrete mathematics as it is used in computer science, fostering logical methods of problem solving and thinking. Topics include functions, relations, sets, propositional and predicate logic, simple circuit logic, proof techniques, finite state machines, Turing machines, elementary formal language theory, graph theory, Boolean algebra, computability, complexity, elementary combinatorics, and discrete probability. Prereq: Grade of C or better in MATH 150 or MATH 240, or permission of the instructor. Offered: Fall.