WISEMAN STUDY SERIES
WGU C960
DISCRETE MATHEMATICS II
100-QUESTION MOCK EXAM
Correct Answers • Detailed Rationales • Step-by-Step Workings
Original OA-Style Practice Aligned to Core C960 Competencies
2026 EDITION | ORIGINAL EDUCATIONAL PRACTICE
,WGU C960 | 100-QUESTION OA-STYLE MOCK EXAM
Instructions and Exam Blueprint
This is an independently created practice examination. It is not an official WGU objective assessment and does not
reproduce protected assessment questions.
Suggested conditions: Allow 150 minutes. Use scratch paper and an approved calculator consistent with your
course policies. Select one best answer for each item. Complete all 100 questions before consulting the solution
section.
Topic distribution
Competency area Questions
Algorithms and Big-O 10
Searching and Sorting 10
Number Theory 10
Modular Arithmetic 7
Cryptography 3
Recursion and Induction 10
Counting 15
Probability 20
Random Variables 10
Modeling Computation 5
Scoring guide: 85-100 = strong readiness; 75-84 = review missed competencies; below 75 = return to the study
guide and calculation workbook before retesting.
Original 2026 Study Practice Page 2
,WGU C960 | 100-QUESTION OA-STYLE MOCK EXAM
Part I - 100-Question Mock Examination
Algorithms and Big-O
1. What is the asymptotic complexity of accessing one element of an array by index?
A. O(1)
B. O(log n)
C. O(n)
D. O(n²)
2. A loop executes once for each of n records. What is its complexity?
A. O(1)
B. O(log n)
C. O(n)
D. O(n log n)
3. Two consecutive loops each execute n times. What is the combined Big-O complexity?
A. O(n)
B. O(n²)
C. O(2■)
D. O(log n)
4. An n-iteration loop contains another n-iteration loop. What is the complexity?
A. O(n)
B. O(2n)
C. O(n²)
D. O(n log n)
5. A loop repeatedly divides n by 2 until n reaches 1. What is its complexity?
A. O(1)
B. O(log n)
C. O(n)
D. O(n²)
6. Simplify 7n■+3n²+200 using Big-O notation.
A. O(n²)
B. O(n³)
C. O(n■)
D. O(7n■)
Original 2026 Study Practice Page 3
, WGU C960 | 100-QUESTION OA-STYLE MOCK EXAM
7. What is the complexity of an outer n-loop containing an inner loop that doubles from 1 to n?
A. O(log n)
B. O(n)
C. O(n log n)
D. O(n²)
8. The inner loop runs i times for each i from 1 through n. Which complexity applies?
A. O(n)
B. O(n log n)
C. O(n²)
D. O(2■)
9. Which growth rate becomes largest as n increases?
A. O(log n)
B. O(n)
C. O(n³)
D. O(2■)
10. An algorithm has T(n)=4n log■n+9n. What is its Big-O class?
A. O(log n)
B. O(n)
C. O(n log n)
D. O(n²)
Searching and Sorting
11. Which condition is required before standard binary search can be used?
A. The list must contain unique values
B. The list must be sorted
C. The list must be a linked list
D. The target must be numeric
12. What is the worst-case complexity of binary search?
A. O(1)
B. O(log n)
C. O(n)
D. O(n²)
Original 2026 Study Practice Page 4
WGU C960
DISCRETE MATHEMATICS II
100-QUESTION MOCK EXAM
Correct Answers • Detailed Rationales • Step-by-Step Workings
Original OA-Style Practice Aligned to Core C960 Competencies
2026 EDITION | ORIGINAL EDUCATIONAL PRACTICE
,WGU C960 | 100-QUESTION OA-STYLE MOCK EXAM
Instructions and Exam Blueprint
This is an independently created practice examination. It is not an official WGU objective assessment and does not
reproduce protected assessment questions.
Suggested conditions: Allow 150 minutes. Use scratch paper and an approved calculator consistent with your
course policies. Select one best answer for each item. Complete all 100 questions before consulting the solution
section.
Topic distribution
Competency area Questions
Algorithms and Big-O 10
Searching and Sorting 10
Number Theory 10
Modular Arithmetic 7
Cryptography 3
Recursion and Induction 10
Counting 15
Probability 20
Random Variables 10
Modeling Computation 5
Scoring guide: 85-100 = strong readiness; 75-84 = review missed competencies; below 75 = return to the study
guide and calculation workbook before retesting.
Original 2026 Study Practice Page 2
,WGU C960 | 100-QUESTION OA-STYLE MOCK EXAM
Part I - 100-Question Mock Examination
Algorithms and Big-O
1. What is the asymptotic complexity of accessing one element of an array by index?
A. O(1)
B. O(log n)
C. O(n)
D. O(n²)
2. A loop executes once for each of n records. What is its complexity?
A. O(1)
B. O(log n)
C. O(n)
D. O(n log n)
3. Two consecutive loops each execute n times. What is the combined Big-O complexity?
A. O(n)
B. O(n²)
C. O(2■)
D. O(log n)
4. An n-iteration loop contains another n-iteration loop. What is the complexity?
A. O(n)
B. O(2n)
C. O(n²)
D. O(n log n)
5. A loop repeatedly divides n by 2 until n reaches 1. What is its complexity?
A. O(1)
B. O(log n)
C. O(n)
D. O(n²)
6. Simplify 7n■+3n²+200 using Big-O notation.
A. O(n²)
B. O(n³)
C. O(n■)
D. O(7n■)
Original 2026 Study Practice Page 3
, WGU C960 | 100-QUESTION OA-STYLE MOCK EXAM
7. What is the complexity of an outer n-loop containing an inner loop that doubles from 1 to n?
A. O(log n)
B. O(n)
C. O(n log n)
D. O(n²)
8. The inner loop runs i times for each i from 1 through n. Which complexity applies?
A. O(n)
B. O(n log n)
C. O(n²)
D. O(2■)
9. Which growth rate becomes largest as n increases?
A. O(log n)
B. O(n)
C. O(n³)
D. O(2■)
10. An algorithm has T(n)=4n log■n+9n. What is its Big-O class?
A. O(log n)
B. O(n)
C. O(n log n)
D. O(n²)
Searching and Sorting
11. Which condition is required before standard binary search can be used?
A. The list must contain unique values
B. The list must be sorted
C. The list must be a linked list
D. The target must be numeric
12. What is the worst-case complexity of binary search?
A. O(1)
B. O(log n)
C. O(n)
D. O(n²)
Original 2026 Study Practice Page 4
