CSE 2300:Discrete Structures for Computing

3 Class Hours 0 Laboratory Hours 3 Credit Hours
Prerequisite: ((CSE 1321 and CSE 1321L) or CSE 1311) and (MATH 1113 or (MATH 1111 and MATH 1112))
Coverage of discrete structures is crucial to any program in computing. This course covers propositional and predicate logic, proofs, set theory, relations and functions, algorithms and complexity theory, matrices, graphs and trees, and combinatorics. Throughout the emphasis will be on applications of these concepts in computing.