Faculty of Engineering & Technology

Term Test Question Paper – B. Tech.

Department: Computer Science and Engineering
Programme: B. Tech. (CSE)
Semester/Batch: 3rd / 2017
Date of Examination: 17th November 2018
Course Code: CSC201A
Course Title: Discrete Mathematics-1
Term Test - 3
INSTRUCTIONS TO STUDENTS:

1. Answer ALL the questions

2. Use only SI units
3. Use of non-programmable scientific calculator is permitted
4. Use of data handbook permitted wherever applicable
5. Missing data may be appropriately assumed
6. Indicate the question number (including its part as applicable) for your answers

Maximum Duration: 1 Hour Maximum Marks: 25

IMPORTANT:
You may take this question paper away at the end of the examination. Please keep it in a safe place for future
reference

Question No. 1 (5 Marks)

For the sub questions 1.1-1.10, multiple choices are indicated as possible answers. You are supposed
to pick and write any one of the choices as your answer in the answer booklet. (Each sub question
carries ½ (half) mark):

1.1 The Inference Rule applied in the argument “Ashwini scored a 100. Therefore, someone
scored a 100.” is ________________.
a. Existential Instantiation c. Universal Instantiation
b. Existential Generalisation d. Universal Generalisation
1.2 The Rule of Inference used in the argument “An arbitrary positive integer greater than 2 has
a prime factor. Hence, every positive integer greater than 2 has a prime factor.” is _________.
a. Universal Instantiation c. Modes Ponens
b. Universal Generalisation d. Modes Tollens
1.3 The general solution to the recurrence relation 𝑎𝑛 = 3 𝑎𝑛−1 − 2 𝑎𝑛−2 is __________.
a. 𝑎𝑛 = 𝛼1 3𝑛 + 𝛼2 2𝑛 c. 𝑎𝑛 = 𝛼1 + 𝛼2 2𝑛
b. 𝑎𝑛 = 𝛼1 3𝑛 + 𝛼2 𝑛2𝑛 d. 𝑎𝑛 = 𝛼1 + 𝛼2 3𝑛
1.4 The general solution for a recurrence relation with Characteristic Roots 2, 2, −2 is _______.
a. 𝑎𝑛 = 𝛼1 2𝑛 + 𝛼2 2𝑛 − 𝛼3 2𝑛 c. 𝑎𝑛 = 𝛼1 2𝑛 + 𝛼2 𝑛2𝑛 − 𝛼3 2𝑛
𝑛 𝑛
b. 𝑎𝑛 = 𝛼1 2 + 𝛼2 2 + d. 𝑎𝑛 = 𝛼1 2𝑛 + 𝛼2 𝑛2𝑛 +
𝛼3 (−1)𝑛 2𝑛 𝛼3 (−1)𝑛 2𝑛

1
 1.5 A particular solution of the recurrence relation 𝑎𝑛 = 7 𝑎𝑛−1 − 12 + (𝑛2 + 1)5𝑛 is ______.
a. (𝑝2 𝑛2 + 𝑝1 𝑛 + 𝑝0 )5𝑛 c. 5𝑛
2
b. (𝑝2 𝑛 + 1)5 𝑛 d. 𝑛(𝑝2 𝑛2 + 𝑝1 𝑛 + 𝑝0 )5𝑛
2 3
1.6 The function 𝐺(𝑥) = 1 + 2𝑥 + (2𝑥) + (2𝑥) + ⋯ is the Generating Function of the
sequence ________.
a. 1, 2, 2, 2, … b. 1, 1/2, 1/4, …
c. 1, 2, 4, 8, … d. 2, 4, 8, 16, …
1
1.7 The value of the Extended Binomial Coefficient 𝐶(4 , 3) is _______.
a. 7/128 c. 3/4
b. 1/12 d. −7/128
1.8 A theorem which follows directly from another theorem is called a ______.
a. Lemma c. Conjecture
b. Proposition d. Corollary
1.9 The statement “If √2 is rational, then 1 + 1 = 2” has a __________ proof.
a. Vacuous c. Direct
b. Trivial d. Indirect
1 1 1 1
1.10 The formula for the series 1⋅2 + 2⋅3 + 3⋅4 + ⋯ + 𝑛⋅(𝑛+1) can be conjectured as ________.
a. 1 c. 1/𝑛
b. 𝑛/(𝑛 + 1) d. 𝜋

Question No. 2 (2.5 + 2.5 = 5 Marks)

a) Solve the following recurrence relation with the given initial conditions:
𝑎𝑛 = 6 𝑎𝑛−1 − 9 𝑎𝑛−2 ; 𝑎0 = 1, 𝑎1 = 6.
b) Determine a particular solution to the following non-homogeneous recurrence relation:
𝑎𝑛 = 6 𝑎𝑛−1 − 9 𝑎𝑛−2 + 3𝑛 .

Question No. 3 (1.5 + 2 + 1.5 = 5 Marks)

a) Develop a recurrence relation and initial conditions for 𝑎𝑛 , where 𝑎𝑛 is the number of non-
negative integers with 𝑛 digits which do not have consecutive 0s.
b) Derive the following power series using Extended Binomial Theorem:
(1 + 𝑥)−1 = 1 − 𝑥 + 𝑥 2 − 𝑥 3 + ⋯ + (−1)𝑘 𝑥 𝑘 + ⋯ ; |𝑥| < 1.
c) Construct a valid argument that the Conclusion “Fido is not human” follows from the premises
“No human is a dog” and “Fido is a dog” using Inference Rules of Predicate Logic.

Question No. 4 (1 + 2 + 2 = 5 Marks)

a) Describe the Proof by Contraposition method.
b) Prove the theorem “A positive integer 𝑛 is even if 𝑛2 is even.”
c) Develop a proof for the statement: “For a positive integer 𝑛, 3𝑛 + 2 is even if and only if 𝑛 is
even.

Question No. 5 (1 + 2 + 2 = 5 Marks)

a) State the Principle of Mathematical Induction.
b) Prove the following formula using Mathematical Induction:
2 𝑛−1
𝑎(1 − 𝑟 𝑛 )
𝑎 + 𝑎𝑟 + 𝑎𝑟 + ⋯ + 𝑎𝑟 = .
1−𝑟
𝑛(𝑛−1)
c) Prove that the number of subsets of size 2 of a finite set with 𝑛 elements is 2 using
Mathematical Induction.

*******

2
 CSC201A Discrete Mathematics-1 Term Test 1

21 September 2018

Detailed Scheme of Evaluation

Q. Tasks –Steps Marks Instructor’s Expected Solution Total

No. involved Allotte Allotted
d for Marks
steps for the
questio
n
1 Select and 1/2 1. 1. b
enter mark 1. 2. b 5 Marks
appropriate for 1. 3. c
answers each 1. 4. d
correct 1. 5. a
answer 1. 6. c
1. 7. d
1. 8. d
1. 9. a
1. 10. b
2 a) Solving the 2.5 1. Characteristic Equation is 𝑟 2 − 6𝑟 + 9 = 0 which has a repeated 2.5
given Marks root 𝑟 = 3. Marks
recurrence 2. Therefore, the general solution is 𝑎𝑛 = 𝛼1 3𝑛 + 𝛼2 𝑛 3𝑛 .
relation 3. Using the given initial conditions 𝛼1 = 𝑎0 = 1 and 3𝛼1 + 3𝛼2 = 6. ∴
𝛼2 = 1.
4. Hence the solution is 𝑎𝑛 = 3𝑛 (1 + 𝑛).
2 b) Determining 2.5 From 2 a), 3 is a root of the homogeneous equation 𝑎𝑛 = 6 𝑎𝑛−1 − 2.5
a particular Marks 9 𝑎𝑛−2 with multiplicity 2. Hence, a particular solution has the form Marks
solution to 𝑎𝑛,𝑝 = 𝑛2 𝛼3 3𝑛 .
the given Substituting this in the non-homogeneous equation, we have
recurrence 𝑛2 𝛼3 3𝑛 = 6 (𝑛 − 1)2 𝛼3 3𝑛−1 − 9 (𝑛 − 2)2 𝛼3 3𝑛−2 + 3𝑛 .
relation 1
Simplifying, we get 𝛼3 = 1/2. Hence, 𝑎𝑛,𝑝 = 𝑛2 3𝑛 .
2
3 a) Development 1.5 Let 𝑎𝑛 be the number of non-negative integers with 𝑛 digits without 1.5
of a Marks consecutive 0s. Marks
recurrence Any such integer can either end in a 0 or in any other digit.
relation for In the first case, the last but-one digit has to be a digit other than 0. And
the given set the remaining 𝑛 − 2 digits should not have consecutive 0s. Hence,
of integers. there are 9𝑎𝑛−2 such numbers.
In the second case, the remaining 𝑛 − 1 digits form an integer without
consecutive 0s. There are 9𝑎𝑛−1 such numbers.
By sum rule of counting, the required number satisfies the recurrence
relation
𝑎𝑛 = 9𝑎𝑛−1 + 9 𝑎𝑛−2 .
The required initial conditions are 𝑎1 = 0, 𝑎2 = 3.
3 b) Derivation of 2 By Extended Binomial Theorem, (1 + 𝑥)𝑛 = ∑∞ 𝑘
𝑘=0 𝐶(𝑛, 𝑘)𝑥 where 2 Marks
the power Marks 𝐶(𝑛, 𝑘) is the Extended Binomial Coefficient.
series We know that for a positive integer 𝑛, 𝐶(−𝑛, 𝑘) = (−1)𝑘 𝐶(𝑛 + 𝑘 −
formula 1, 𝑘).
Taking 𝑛 = 1, we have 𝐶(−1, 𝑘) = (−1)𝑘 𝐶(𝑘, 𝑘) = (−1)𝑘 .
Hence, (1 + 𝑥)−1 = ∑∞ 𝑘 𝑘
𝑖=0(−1) 𝑥 as required.

3
3 c) Construction 1.5 Define Predicates Human(𝑥): ‘𝑥 is a Human’ and Dog(𝑥): ‘𝑥 is a Dog’ 1.5
of a valid Marks over the Universe of all things. Marks
argument Then, the given statements are:
using Premise1: ∀𝑥 (Human(𝑥) → ¬Dog(𝑥))
Predicate Premise2: Dog(Fido)
Logic Conclusion: ¬ Human(Fido)
Valid Argument:
1. ∀𝑥 (Human(𝑥) → ¬Dog(𝑥)) Premise1
2. Human(Fido) → ¬Dog(Fido) U. I. on 1.
3. Dog(Fido) Premise2
4. ¬Human(Fido) M. T. on 2 and 3.
4 a) Description 1 The Proof of Contraposition technique involves proving the 1 Marks
of Proof by Marks Contrapositive ¬𝑞 → ¬𝑝 when it is required to prove 𝑝 → 𝑞.
Contrapositio
n

4 b) Proving the 2 The given Theorem can be expressed as ∀𝑛 ∈ ℤ (even(𝑛2 ) → 2 Marks

given Marks even(𝑛)). By U. E., enough to prove that for an arbitrary 𝑛 positive
Theorem integer 𝑛, even(𝑛2 ) → even(𝑛).
Proof by Contraposition:
Consider the Contrapositive: odd(𝑛) → odd(𝑛2 )
Direct proof of this: 𝑛 odd implies 𝑛 = 2𝑘 + 1 for some integer 𝑘.
Therefore 𝑛2 = 2(2𝑘 2 + 2𝑘) + 1 is also odd. Q.E.D.
4 c) Proving the 2 Part i) (Sufficiency) To prove that 3𝑛 + 2 is even if 𝑛 is even. 2 Marks
given Marks Direct: 𝑛 even implies 𝑛 = 2𝑘 for some integer 𝑘. So, 3𝑛 + 2 =
statement 2 (3𝑘 + 1) is even.
Part ii) (Necessity) To prove that 𝑛 is even if 3𝑛 + 2 is even.
Proof by Contraposition. To prove that 𝑛 is odd implies 3𝑛 + 2 is odd.
Assume 𝑛 is odd. Then 𝑛 = 2𝑘 + 1 for some integer 𝑘 and 3𝑛 + 2 =
2(3𝑘 + 2) + 1 is odd. Q.E.D.

5 a) Statement of 1 Over the domain of integers 𝑛 ≥ 𝑏, |𝑏| < ∞, (𝑏 = 1 is common) 2 Marks

PMI Marks [𝑃(𝑏) ∧ ∀𝑘 ≥ 𝑏 (𝑃(𝑘) → 𝑃(𝑘 + 1))] → ∀𝑛 ≥ 𝑏 𝑃(𝑛)
Or, if
BASIS STEP: 𝑃(𝑏) is true
INDUCTIVE STEP: ∀𝑘 ≥ 𝑏 (𝑃(𝑘) → 𝑃(𝑘 + 1))
Then, ∀𝑛 ≥ 𝑏 𝑃(𝑛)
5 b) Proof of 2 𝑎(1−𝑟𝑛)
𝑃(𝑛): 𝑎 + 𝑎𝑟 + 𝑎𝑟 2 + ⋯ + 𝑎𝑟 𝑛−1 = .
given identity Marks 1−𝑟
1) BASIS STEP: To prove that 𝑃(1) is True.
using PMI
LHS of the equality in 𝑃(1) is just 𝑎. And the RHS equals 𝑎.
Hence Proven.
2) INDUCTIVE STEP: To prove that ∀𝑘 (𝑃(𝑘) → 𝑃(𝑘 + 1)) is
True.
Direct Proof.
Assume 𝑃(𝑘) for an arbitrary 𝑘. (Induction Hypothesis).
To prove that
𝑎(1−𝑟𝑛+1 )
𝑎 + 𝑎𝑟 + 𝑎𝑟 2 + ⋯ + 𝑎𝑟 𝑛−1 + 𝑎𝑟 𝑛 = .
1−𝑟
LHS = 𝑎 + 𝑎𝑟 + 𝑎𝑟 2 + ⋯ + 𝑎𝑟 𝑛−1 + 𝑎𝑟 𝑛
𝑎(1 − 𝑟𝑛 )
= + 𝑎𝑟𝑛
1−𝑟
𝑎(1−𝑟𝑛+1 )
=
1−𝑟
.
Q.E.D.

4
5 c) Prove that 2 Let 𝑃(𝑛): Number of size-2 subsets of a finite set with 𝑛 elements is 2 Marks
the given Marks 𝑛(𝑛 − 1)/2.
formula is 1) BASIS STEP: To prove 𝑃(1) is true. A singleton set has 0 size-2
correct for all 1(0)
subsets. = 0. Therefore, proven.
2
positive
3) INDUCTIVE STEP: To prove that ∀𝑘 (𝑃(𝑘) → 𝑃(𝑘 + 1)) is
integers 𝑛.
True.
Direct Proof.
Assume 𝑃(𝑘) for an arbitrary 𝑘. (Induction Hypothesis).
That is, assume any set with 𝑘 elements has 𝑘(𝑘 − 1)/2
subsets of size 2.
Consider any set 𝐴1 of size 𝑘 + 1. Need to prove that it has
𝑘(𝑘 + 1)/2 subsets of size 2.
Then, 𝐴1 = 𝐴 ∪ {𝑎} where 𝐴 is set of size 𝑘 and 𝑎 is not an
element of 𝐴.
Every subset 𝑆 of size 2 of 𝐴1 is either itself a subset of 𝐴 or
𝑆 = {𝑏} ∪ {𝑎}, where 𝑏 is an element of 𝐴.
By Sum Rule, the number of such subsets of 𝐴1 = number of
𝑘(𝑘−1)
direct subsets 𝑆 of 𝐴 + number of elements 𝐴 = +𝑘 =
2
𝑘(𝑘+1)
. Q.E.D.
2