MATH 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, or Entirely Online, or Hybrid.
Grading: A-F grading only.
Cross-listed: CS 211.
Student Learning Outcomes - Upon successful completion of this course students will be able to:

Use logical notation to define fundamental structures and concepts in computer science.
Apply logical reasoning to solve problems regarding basic structures used in computer algorithms and systems.
Construct inductive hypothesis and carry out simple induction proofs.
Model and analyze computational processes using analytic and combinatorial methods.
Apply principles of combinatorics to calculate expectations of simple random processes.