CS 211 - Discrete Structures

Units: 3
Propositional logic and predicate calculus, set theory, inference, induction, recursion, divide-and-conquer, enumeration, graphs and topology, trees, binary trees and traversals, Boolean algebra, logic gates, asymptotic notation and algorithm analysis, combinatorics, cryptography, discrete probability, computational modeling.

Prerequisites: MATH 130 with grade C- or better.
Equivalent Quarter Course: MATH 2150.
Possible Instructional Methods: Entirely On-ground, Entirely On-line, Hybrid (every section of this course may be taught both online and on-ground).
Grading: A-F grading only.
Cross-listed: MATH 211