Untitled document
Discrete Mathematics II syllabus (WGU University)
Ch:1, Algorithms:
- Algorithm Structures
- Analyzing Algorithms
- Big-O Estimates
Ch:2, Number Theory, and Cryptography
- Mathematical Foundations of Encryption.
- Divisibility and Modular Arithmetic.
- Fast Exponentiation Algorithms.
- Number Representation in Other Bases.
- Prime Factorization, GCD, and Euclid’s Algorithm.
Ch:3, Recursion, and Induction
- Induction Methods.
- Recu
ence Relations.
- Recursive Structures.
- Simple Recu
ence Relations.
Ch:4, Counting and Advanced Counting Techniques
- Advanced Counting Techniques.
- Counting by Bijections and Products of Sets.
- Counting with Multisets.
- Counting with Permutations and Combinations.
- Generating Permutations and Combinations.
Ch:5, Discrete Probability
- Conditional Probability and Bayes' Theorem.
- Random Variables.
- Introduction to Probability.
Ch:6, Modeling Computation
- Deterministic Finite Automata.
- Nondeterministic Finite-State Machines.