CSC 133: Discrete Mathematical Structures
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.
MAT 111 or MAT 115, or equivalent.
Discrete Mathematics with Applications, Fourth Edition
Current Semester Pages: