CS 2600 Discrete Structures

Topics include elementary propositional and predicate logics; elementary set theory; relations and their properties; functions; congruence and Euclidean algorithm; combinatorics; mathematical reasoning; matrices; elements of graph theory; trees and their applications; Boolean algebra. Some programming will be required.
CS majors only Students will be charged an additional Comp Science Lab Fee when enrolling in this course. Prerequisite(s): CS 2300 with at least a C- and MATH 1160 or MATH 1350 with at least a C-
Credits: 3.0