CS 250 Discrete Structures
| Old Content |
This page was recently redesigned. To access this course's old homepage, please
click here. |
| Description |
Discrete structures for computer science, including sets, functions, elementary prepositional and predicate logic, Boolean algebra, elementary graph theory combinatorics and proof techniques including induction and contradiction. |
| Credit Hours |
3.000 |
| Type |
Lecture |
| Prerequisites |
Undergraduate level CS 201 Minimum Grade of C and Undergraduate level MA 105 Minimum Grade of C |
| Files |
|
|
