Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
CS 250 - Discrete Structures |
Discrete mathematics for computer science, including elementary propositional andpredicate logic, sets, relations, functions, counting, elementary graph theory, proof techniques including proof by induction, proof by contradiction, and proof by construction. Prerequisites: MA 106 or MA 107 or MA 125 or MA 126 or MA 227.
3.000 Credit hours Levels: Undergraduate Schedule Types: Lecture Computer and Information Sci Department Course Attributes: Tuition Arts and Sciences |