CS 2600 Discrete Structures

Topics include elementary propositional and predicate logics; elementary set theory; relations and their properties; functions; congruences and Euclidean algorithm; combinatorics; mathematical reasoning; matrices; elements of graph theory; trees and their applications. Some programming is required. Course offered Fall and Spring Semesters. Students will be charged an additional Comp Science Lab Fee when enrolling in this course. Prerequisite(s): CS 2300
Credits: 3.0