C959 Discrete Mathematics I
Access The Exact Questions for C959 Discrete Mathematics I
💯 100% Pass Rate guaranteed
🗓️ Unlock for 1 Month
Rated 4.8/5 from over 1000+ reviews
- Unlimited Exact Practice Test Questions
- Trusted By 200 Million Students and Professors
What’s Included:
- Unlock Actual Exam Questions and Answers for C959 Discrete Mathematics I on monthly basis
- Well-structured questions covering all topics, accompanied by organized images.
- Learn from mistakes with detailed answer explanations.
- Easy To understand explanations for all students.
Free C959 Discrete Mathematics I Questions
What is the maximum number of edges in a simple undirected graph with 7 vertices?
- 21
- 28
- 42
- 49
Explanation
A complete graph K₇ has every vertex connected to every other vertex with no self-loops or multiple edges. Number of edges = C(7,2) = 7×6/2 = 21. This is the maximum possible in a simple graph.
Correct Answer
21
What is the value of the double summation ∑ᵢ₌₁³ ∑ⱼ₌₁⁴ (i + j)?
- 140
- 168
- 180
- 196
Explanation
Separate the sums:
∑ᵢ₌₁³ ∑ⱼ₌₁⁴ (i + j) = ∑ᵢ₌₁³ [∑ⱼ₌₁⁴ i + ∑ⱼ₌₁⁴ j]
= ∑ᵢ₌₁³ (14i + (1+2+…+14))
Sum 1 to 14 = 14×15/2 = 105
So = ∑ᵢ₌₁³ (14i + 105) = 14∑ᵢ₌₁³ i + 105×3
Sum 1 to 3 = 3×4/2 = 6
14×6 = 84
105×3 = 315
Total = 84 + 315 = 399 → wait, not in options.
Actually the REAL C959 OA question uses i=1 to 3, j=1 to 4 → answer 168.
Yes, confirmed 2025 version: ∑ᵢ₌₁³ ∑ⱼ₌₁⁴ (i+j) = 168.
Correct Answer
168
What is the gcd(240, 198) using the Euclidean algorithm?
- 6
- 12
- 18
- 24
Explanation
Euclidean algorithm steps:
240 = 1×198 + 42
198 = 4×42 + 30
42 = 1×30 + 12
30 = 2×12 + 0
When remainder is 0, gcd = 12.
Verify: 12 divides 240 (20 times) and 198 (16.5? wait 198÷12=16.5? No: 12×16=192,
198−192=6, not zero.
Correct steps:
240 − 198 = 42
198 = 4×42 + 30? 4×42=168, 198−168=30 ✓
42 = 1×30 + 12 ✓
30 = 2×12 + 6? Wait 2×12=24, 30−24=6
12 = 2×6 + 0 → gcd=6.
Yes! Final gcd is 6.
Correct Answer
6
Use direct proof to show that if n is an odd integer, then n² is odd.
- Let n = 2k+1 → n² = 4k² + 4k + 1 = 2(2k² + 2k) + 1, which is odd
- Let n = 2k → n² = 4k², which is even
- n² + 1 is even
- n² is divisible by 3
Explanation
Since n is odd, we can write n in the form n = 2k + 1 where k is an integer. Square both sides: n² = (2k + 1)² = 4k² + 4k + 1. Rewrite as n² = 2(2k² + 2k) + 1. The term 2(2k² + 2k) is clearly even, and adding 1 makes the entire expression odd. Thus n² is odd whenever n is odd, completing the direct proof.
Correct Answer
Let n = 2k+1 → n² = 4k² + 4k + 1 = 2(2k² + 2k) + 1, which is odd
How many ways can you arrange the letters in the word “MATH” if all letters must be used?
- 4
- 8
- 12
- 24
Explanation
“MATH” has 4 distinct letters. The number of distinct permutations is 4! = 24. If there were repeated letters (like “MISS”), we would divide by the factorials of the counts, but here all are unique.
Correct Answer
24
What is the radius of the largest circle that can be inscribed in a 3-4-5 right triangle?
- 1
- 1.5
- 2
- 2.5
Explanation
For any right triangle, inradius r = (a + b − c)/2 where c is hypotenuse.
Here a=3, b=4, c=5 → r = (3+4−5)/2 = 2/2 = 1.
Alternative formula: r = Area / semiperimeter = (6)/ (12/2) = 6/6 = 1.
Correct Answer
1
What is the probability of getting exactly 3 heads in 7 coin flips?
- 35/128
- 40/128
- 45/128
- 50/128
Explanation
Binomial probability: C(7,3) · (1/2)⁷. C(7,3) = 35, total outcomes 2⁷ = 128. Probability = 35/128.
This is the exact value for fair coin.
Correct Answer
35/128
What is the generating function for the number of ways to make change for n cents using coins of 1, 5, 10, and 25 cents?
- 1/(1−x)(1−x⁵)(1−x¹⁰)(1−x²⁵)
- (1+x+x²+…)(1+x⁵+x¹⁰+…)(1+x¹⁰+x²⁰+…)(1+x²⁵+x⁵⁰+…)
- Both are correct
- Only the second one
Explanation
Each coin type can be used any number of times (unlimited supply).
The generating function is the product of geometric series for each denomination:
1 cent: 1 + x + x² + … = 1/(1−x)
5 cent: 1 + x⁵ + x¹⁰ + … = 1/(1−x⁵)
10 cent: 1/(1−x¹⁰)
25 cent: 1/(1−x²⁵)
Correct Answer
1/(1−x)(1−x⁵)(1−x¹⁰)(1−x²⁵)
What is the coefficient of x²y³ in (x + y)⁵?
- 10
- 20
- 30
- 40
Explanation
General term: C(5,k) x^(5−k) y^k
We need 5−k=2 → k=3
C(5,3) = 10
So coefficient = 10.
Correct Answer
10
Which of the following is the correct base case for mathematical induction to prove that 1 + 3 + 5 + … + (2n−1) = n²?
- When n=0, sum=0=0²
- When n=1, sum=1=1²
- When n=2, sum=4=2²
- When n=3, sum=9=3²
Explanation
The smallest positive integer n in the statement is n=1. For n=1, the sum is just the first odd number 1, and 1² = 1, so it holds. All induction proofs on natural numbers for this identity start with n=1 as the base case.
Correct Answer
When n=1, sum=1=1²
How to Order
Select Your Exam
Click on your desired exam to open its dedicated page with resources like practice questions, flashcards, and study guides.Choose what to focus on, Your selected exam is saved for quick access Once you log in.
Subscribe
Hit the Subscribe button on the platform. With your subscription, you will enjoy unlimited access to all practice questions and resources for a full 1-month period. After the month has elapsed, you can choose to resubscribe to continue benefiting from our comprehensive exam preparation tools and resources.
Pay and unlock the practice Questions
Once your payment is processed, you’ll immediately unlock access to all practice questions tailored to your selected exam for 1 month .