Untitled document Discrete Mathematics II syllabus (WGU University) Ch:1, Algorithms: - Algorithm Structures - Analyzing Algorithms - Big-O Estimates Ch:2, Number Theory, and Cryptography -...

The exam contains 55 multiple-choice questions. For passing grade muse answer at least 40 questions correct out of 55 questions. Exam time: 2 hours and a half.
The exam will be very similar to these questions (sample): https://quizlet.com/577218580/discrete-ii-pre-assessment-flash-cards/


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. - Recurrence Relations. - Recursive Structures. - Simple Recurrence 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.