Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
CSE 2300 - Discrete Struct Comp |
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.
3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Semester Schedule Types: Lecture Lower, 1000-2000 level Division Software Eng & Game Dev Department |