CS 250 Discrete Structures
| Description |
Discrete mathematics for computer science, including elementary propositional and predicate logic, sets, relations, functions, counting, elementary graph theory, proof techniques including proof by induction, proof by contradiction, and proof by construction. |
| Credit Hours |
Non-credit |
| Type |
Lecture |
| Prerequisites |
Undergraduate level MA 106 Minimum Grade of C or Undergraduate level MA 107 Minimum Grade of C or Undergraduate level MA 125 Minimum Grade of C or Undergraduate level MA 126 Minimum Grade of C or Undergraduate level MA 227 Minimum Grade of C |
| Files |
|
|
