WGU C960 Discrete Math II PA (with complete solutions) (Latest 2026/2027 Update) 100% Verified Actual Exam Questions & Answers | Grade A

WGU C960 Discrete Math II PA (with
complete solutions) (Latest 2026/2027
Update) 100% Verified Actual Exam
Questions & Answers | Grade A

Accelerate your WGU C960 preparation with this comprehensive exam review.
It features over 50 verified questions, step-by-step solutions, and detailed
rationales covering the entire Discrete Mathematics II curriculum. Perfect for
mastering algorithms, RSA cryptography, combinatorics, and probability.
Key Concepts Covered
• Algorithms & Complexity: Tracing pseudocode, recursive functions,
and calculating worst-case time complexity using Big O notation.
• Number Theory: Mastering the Euclidean algorithm, the extended
Euclidean algorithm, and modular multiplicative inverses for RSA
encryption.
• Combinatorics & Probability: Advanced counting rules, permutations,
combinations, Bayes' Theorem, and calculating expected value.
• Discrete Mathematics: Direct and inductive proofs, recurrence
relations, and base conversions (binary, hexadecimal, decimal).
Why Choose This Resource?
• Exam-Style Practice: Practice assessment (PA) questions designed to
simulate the exact difficulty and structure of the actual Objective
Assessment (OA).
• Step-by-Step Solutions: Full mathematical workings and pseudocode
trace-throughs so you understand why the answer is correct, not just what
it is.
• Save Time: Skip the guesswork and focus on the high-yield topics that
students and alumni struggle with the most.


1

, Quiz_________________?
Pre-Assessment: Algorithms - Algorithm Structures:
Question 1:
Consider the following pseudocode that merges two lists of numbers into one:
Merge0(List1, List2)
Set OUTlist to empty
While List1 is not empty OR List2 is not empty
If one list is empty and the other is not,
Remove the first number from the non-empty list and add it to OUTlist
If both lists are non-empty,
Remove the first number from List1 and add it to OUTlist
Remove the first number from List2 and add it to OUTlist
Return OUTlist


If ListA is [1, 3, 5] and ListB is [2, 4, 6] then what is the result of Merge0 (ListA, Merge0 (ListB,
ListA))? -

Answer
[ 1, 2, 3, 1, 5, 4, 3, 6, 5 ]
Step 1:
To solve this, we need to understand how the Merge0 function works. It merges two lists by
taking the first element of each list and adding it to the output list in ascending order. If one list
is empty and the other is not, it removes the first element from the non-empty list and adds it
to the output list.
Using the given example, we have:
ListA = [1, 3, 5]
ListB = [2, 4, 6]
Now, let's analyze the innermost function Merge0(ListB, ListA):
1. OUTlist = empty



2

,2. OUTlist = [2]
3. OUTlist = [2, 1]
4. OUTlist = [2, 1, 4]
5. OUTlist = [2, 1, 4, 3]
6. OUTlist = [2, 1, 4, 3, 6]
7. OUTlist = [2, 1, 4, 3, 6, 5]
8. ListA is now empty, so we return OUTlist = [2, 1, 4, 3, 6, 5]
Step 2:
Now, let's use the result of Merge0(ListB, ListA) as the second argument for the outer Merge0
function. So we have:
List1 = ListA = [1, 3, 5]
List2 = Merge0(ListB, ListA) = [2, 1, 4, 3, 6, 5]
Using the Merge0 function with these lists, we have:
1. OUTlist = empty
2. OUTlist = [1]
3. OUTlist = [1, 2]
4. OUTlist = [1, 2, 3]
5. OUTlist = [1, 2, 3, 1]
6. OUTlist = [1, 2, 3, 1, 5]
7. OUTlist = [1, 2, 3, 1, 5, 4]
8. OUTlist = [1, 2, 3, 1, 5, 4, 3]
9. OUTlist = [1, 2, 3, 1, 5, 4, 3, 6]
10. OUTlist = [1, 2, 3, 1, 5, 4, 3, 6, 5]
11. return OUTlist = [1, 2, 3, 1, 5, 4, 3, 6, 5]
Therefore, the result of Merge0(ListA, Merge0(ListB, ListA)) is [1, 2, 3, 1, 5, 4, 3, 6, 5].




Quiz_________________?



3

, Pre-Assessment: Algorithms - Algorithm Structures:
Question 2:


Given this pseudocode:
S = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20}
x=2
While(x<11):
For i in S:
If 0 ≡ i mod x and i ≠ x:
delete i from S
end-If
end-For
x=x+1
end-While


What is S at the end of this code? -

Answer
{2, 3, 5, 7, 11, 13, 17, 19}


This code is nothing but finding the prime numbers from the given set.
Start from x = 2
1) When x = 2, we have to delete that elements from S which satisfy 0 == i mod 2 and i ≠ 2 i.e
multiples of 2 except 2. So we remove {4, 6, 8, 10, 12, 14, 16, 18, 20}
x = x+1
2) When x = 3, we have to delete that elements from S which satisfy 0 == i mod 3 and i ≠ 3 i.e
multiples of 3 except 3. So we remove {6, 9, 12, 15, 18}
x = x+1
3) When x = 4, we have to delete that elements from S which satisfy 0 == i mod 4 and i ≠ 4 i.e
multiples of 4 except 4. So we remove {8, 12, 16, 20}


4