Discrete Mathematics involves math where the values and structures that are "used" in the mathematics only occur in distinct intervals. For example, a mathematics where only integers, and no fractional numbers, are used would be a discrete mathematical system.

Such systems are often used in computer science. A world where things are either "on" or "off" and never halfway in between is a world of discrete mathematics.

Non-Magnet Juniors and Seniors may also take this course if they have completed A.P. Computer Science or Analysis of Algorithms, and Precalculus with Analysis.

Topics include:

• Sets
  • Survey Sampling
  • Ballot Counting Methods
• Graphs
  • Definitions and Terminology
  • Depth, Breath and Dijkstra Paths and Circuits
  • Scheduling
• Trees
• Search Trees
• Minimum Spanning Trees
• Counting Theory
  • Sum and Product Rules
  • Permutations
  • Combinations
• Probability
  • Terms and Definitions
  • Conditional Probability
  • Bayes' Theorem
  • Expected Value
• Linear Programming
  • Graphical Solutions
  • Algebraic Solutions
  • Geometrical Solutions
  • The Simplex Algorithm
• Matrices
• Matrix Arithmetic
• Gauss-Jordan Elimination
• Game Theory
  • Pure Strategies
  • Mixed Strategies