CSC 133
Discrete Mathematical Structures
|
| Course Description |
Introduction to discrete mathematics
applicable to computer science. Propositional and predicate logic,
basic proof techniques, set algebra and Boolean algebra, recursion
and induction, trees and graphs, introductory combinatorics. Four lecture hours each week. |
| Prerequisites |
MAT 111 or MAT 115, or equivalent |
| Textbook |
 |
Discrete
Mathematics with Applications
3rd Edition
Susanna S. Epp
Brooks/Cole Thomson Learning, 2003. |
