COS 210 Discrete Structures in Computing

This course provides an overview of discrete structures appropriate for work in computer science. Topics covered in this course include logic and proofs, set theory, inductive and recursive definitions and arguments, fundamentals of counting, discrete probability, relations and automata, including FSM, Turing Machines and their application, such as language recognition. Emphasis is placed on applications to algorithms and programming problems. This course requires a student laptop - see Department Laptop Policy. Prerequisite(s): COS 130 or COS 131 and math level 3 or permission of the instructor. 4 hour(s).