1
WGU C959 Discrete Math I Exam Study Guide
2026-2027 Complete Questions with Verified
Solutions & Rationales
Guaranteed Success | Latest Update | Graded A+
QUESTION 1
What is the number of ways to choose a committee of k people from n people?
A) P(n,k)
B) C(n,k)
C) n^k
D) n!/(k!(n-k)!)
Solution: Combinations C(n,k) count unordered selections .
QUESTION 2
What is the number of ways to choose a president and vice president from n people?
A) C(n,2)
B) P(n,2) = n(n-1)
C) n²
D) n!
Sure pass
,2
Solution: Ordered selection: P(n,2) .
QUESTION 3
What is the number of ways to choose two people from n people without regard to
order?
A) P(n,2)
B) C(n,2) = n(n-1)/2
C) n²
D) n!
Solution: Unordered selection: C(n,2) .
QUESTION 4
What is the number of bit strings of length n with exactly k ones?
A) 2^n
B) C(n,k)
C) P(n,k)
D) n^k
Solution: Choose k positions to be 1 and the rest 0: C(n,k) .
Sure pass
,3
QUESTION 5
What is the number of ways to seat n people in a row?
A) (n-1)!
B) n!
C) n²
D) 2^n
Solution: n! ways to arrange n distinct people in a row .
QUESTION 6
What is the number of ways to seat n people in a circle?
A) n!
B) (n-1)!
C) n²
D) 2^n
Solution: (n-1)! distinct arrangements in a circle .
QUESTION 7
What is the number of ways to distribute n identical balls into k distinct boxes?
A) k^n
B) C(n+k-1, n)
Sure pass
, 4
C) P(n,k)
D) n!
Solution: Stars and bars: C(n+k-1, n) .
QUESTION 8
What is the principle of inclusion-exclusion for counting?
A) To count the union, add sizes, subtract intersections, etc.
B) To count the union, multiply sizes
C) To count the union, add sizes only
D) To count the union, subtract sizes only
Solution: Inclusion-Exclusion corrects for overcounting of intersections .
QUESTION 9
What is the number of subsets of a set with n elements?
A) n!
B) n²
C) 2^n
D) n(n+1)/2
Solution: A set with n elements has 2^n subsets (including empty set) .
Sure pass
WGU C959 Discrete Math I Exam Study Guide
2026-2027 Complete Questions with Verified
Solutions & Rationales
Guaranteed Success | Latest Update | Graded A+
QUESTION 1
What is the number of ways to choose a committee of k people from n people?
A) P(n,k)
B) C(n,k)
C) n^k
D) n!/(k!(n-k)!)
Solution: Combinations C(n,k) count unordered selections .
QUESTION 2
What is the number of ways to choose a president and vice president from n people?
A) C(n,2)
B) P(n,2) = n(n-1)
C) n²
D) n!
Sure pass
,2
Solution: Ordered selection: P(n,2) .
QUESTION 3
What is the number of ways to choose two people from n people without regard to
order?
A) P(n,2)
B) C(n,2) = n(n-1)/2
C) n²
D) n!
Solution: Unordered selection: C(n,2) .
QUESTION 4
What is the number of bit strings of length n with exactly k ones?
A) 2^n
B) C(n,k)
C) P(n,k)
D) n^k
Solution: Choose k positions to be 1 and the rest 0: C(n,k) .
Sure pass
,3
QUESTION 5
What is the number of ways to seat n people in a row?
A) (n-1)!
B) n!
C) n²
D) 2^n
Solution: n! ways to arrange n distinct people in a row .
QUESTION 6
What is the number of ways to seat n people in a circle?
A) n!
B) (n-1)!
C) n²
D) 2^n
Solution: (n-1)! distinct arrangements in a circle .
QUESTION 7
What is the number of ways to distribute n identical balls into k distinct boxes?
A) k^n
B) C(n+k-1, n)
Sure pass
, 4
C) P(n,k)
D) n!
Solution: Stars and bars: C(n+k-1, n) .
QUESTION 8
What is the principle of inclusion-exclusion for counting?
A) To count the union, add sizes, subtract intersections, etc.
B) To count the union, multiply sizes
C) To count the union, add sizes only
D) To count the union, subtract sizes only
Solution: Inclusion-Exclusion corrects for overcounting of intersections .
QUESTION 9
What is the number of subsets of a set with n elements?
A) n!
B) n²
C) 2^n
D) n(n+1)/2
Solution: A set with n elements has 2^n subsets (including empty set) .
Sure pass
