WGU C960 – Discrete Mathematics II Objective Assessment
Review Practice Exam | Questions, Verified Correct Answers and
Explanations –2026/2027 Latest Update |Graded A+.
Question 1
Which proof technique is MOST appropriate for proving that a statement is
true for every positive integer?
A. Proof by mathematical induction
B. Proof by contradiction
C. Direct proof only
D. Proof by exhaustion
Correct Answer: A. Proof by Mathematical Induction
Explanation: Mathematical induction is specifically designed to prove
statements involving all positive integers. It consists of verifying a base case
and proving that if the statement holds for one integer, it also holds for the
next.
Question 2
If a graph contains exactly one simple path between every pair of vertices, the
graph is called a:
A. Tree
B. Cycle
C. Complete graph
D. Bipartite graph
1|Page
,Correct Answer: A. Tree
Explanation: A tree is a connected graph with no cycles, ensuring exactly one
simple path exists between every pair of vertices.
Question 3
Evaluate:
(17 \bmod 5)
A. 2
B. 3
C. 4
D. 5
Correct Answer: A. 2
Explanation: Since (17 = 5(3)+2), the remainder is 2.
Question 4
How many subsets does a set containing 6 elements have?
A. 32
B. 64
C. 128
D. 256
Correct Answer: B. 64
2|Page
,Explanation: A set with (n) elements has (2^n) subsets. Since (2^6=64), there
are 64 subsets.
Question 5
Which notation describes the worst-case upper bound of an algorithm?
A. Big-O
B. Big-Ω
C. Big-Θ
D. Little-o
Correct Answer: A. Big-O
Explanation: Big-O notation represents the maximum growth rate of an
algorithm as input size increases.
Question 6
A connected graph with 15 vertices has how many edges if it is a tree?
A. 14
B. 15
C. 16
D. 30
Correct Answer: A. 14
Explanation: Every tree with (n) vertices has exactly (n-1) edges.
3|Page
, Question 7
Which recurrence relation defines the Fibonacci sequence?
A. (F_n=F_{n-1}+F_{n-2})
B. (F_n=2F_{n-1})
C. (F_n=n^2)
D. (F_n=n!)
Correct Answer: A. (F_n=F_{n-1}+F_{n-2})
Explanation: Each Fibonacci number is the sum of the previous two numbers.
Question 8
How many ways can 5 distinct books be arranged on a shelf?
A. 25
B. 60
C. 120
D. 625
Correct Answer: C. 120
Explanation: The number of permutations is (5! = 120).
Question 9
Which Boolean identity is represented by:
(A+0=A)
4|Page
Review Practice Exam | Questions, Verified Correct Answers and
Explanations –2026/2027 Latest Update |Graded A+.
Question 1
Which proof technique is MOST appropriate for proving that a statement is
true for every positive integer?
A. Proof by mathematical induction
B. Proof by contradiction
C. Direct proof only
D. Proof by exhaustion
Correct Answer: A. Proof by Mathematical Induction
Explanation: Mathematical induction is specifically designed to prove
statements involving all positive integers. It consists of verifying a base case
and proving that if the statement holds for one integer, it also holds for the
next.
Question 2
If a graph contains exactly one simple path between every pair of vertices, the
graph is called a:
A. Tree
B. Cycle
C. Complete graph
D. Bipartite graph
1|Page
,Correct Answer: A. Tree
Explanation: A tree is a connected graph with no cycles, ensuring exactly one
simple path exists between every pair of vertices.
Question 3
Evaluate:
(17 \bmod 5)
A. 2
B. 3
C. 4
D. 5
Correct Answer: A. 2
Explanation: Since (17 = 5(3)+2), the remainder is 2.
Question 4
How many subsets does a set containing 6 elements have?
A. 32
B. 64
C. 128
D. 256
Correct Answer: B. 64
2|Page
,Explanation: A set with (n) elements has (2^n) subsets. Since (2^6=64), there
are 64 subsets.
Question 5
Which notation describes the worst-case upper bound of an algorithm?
A. Big-O
B. Big-Ω
C. Big-Θ
D. Little-o
Correct Answer: A. Big-O
Explanation: Big-O notation represents the maximum growth rate of an
algorithm as input size increases.
Question 6
A connected graph with 15 vertices has how many edges if it is a tree?
A. 14
B. 15
C. 16
D. 30
Correct Answer: A. 14
Explanation: Every tree with (n) vertices has exactly (n-1) edges.
3|Page
, Question 7
Which recurrence relation defines the Fibonacci sequence?
A. (F_n=F_{n-1}+F_{n-2})
B. (F_n=2F_{n-1})
C. (F_n=n^2)
D. (F_n=n!)
Correct Answer: A. (F_n=F_{n-1}+F_{n-2})
Explanation: Each Fibonacci number is the sum of the previous two numbers.
Question 8
How many ways can 5 distinct books be arranged on a shelf?
A. 25
B. 60
C. 120
D. 625
Correct Answer: C. 120
Explanation: The number of permutations is (5! = 120).
Question 9
Which Boolean identity is represented by:
(A+0=A)
4|Page
