Roll No........................

Total No. of Questions : 13] [Total No. of Pages : 03

J-3656[S-1512] [2037]
M.Sc. (CST) (Semester - 2nd)
DISCRETE MATHEMATICS & NUMERICAL METHODS
USING C (M.Sc. (CST) - 203)
Time : 03 Hours Maximum Marks : 75

Instruction to Candidates:
1) Section - A is compulsory.
2) Attempt any Nine questions from Section - B.

Section - A
Q1) (15 x 2 = 30)

a) If A = { a, b, c, d, e}, B = {b, d, e, g, f }, prove that A  B = B  A .

b) Define intersection and cartesian product of two sets.
c) Define an equivalence relation.
d) Define partial order relations and matrix of a relation.
e) Define composition of two functions. If f : R → R is defined by
f (x) = x2 and g : R → R defined by g ( x) = x + 3, then find fog.
f) Define a binary relation. If a binary relation ‘* ’ on Q is defined by
a * b = a + b - ab, a, b ∈ Q, find the identity element of (Q,* ).
g) Define principle of mathematical induction. Let P(n) be the statement
P(n): n 3 + (n + 1)3 + (n + 2 )3 is divisible by 9 ∀n ∈ N. If P(k) is true prove
that P(k + 1) is also true.
h) Define permutation and combination of n objects taken r at a time.

p = p3 + 3 9p .
10 9
i) Prove that 3 2

j) Define tautology and contradiction.

k) Form the conjuction and disjunction of p : It is cold, q : It is raining.

P.T.O.
 l) Define Boolean algebra and Boolean functions.
m) State duality and idempotent laws of Boolean algebra.

n) Construct truth table for ~ [p Λ (~ q ) ].

o) Solve 9ak +2 − 6ak + 1 + ak = 0

Section - B
(9 x 5 = 45)
Q2) Use generating function to solve the recurrence relation
yn + 2 − 4 yn +1 + 3 yn = 0, y0 = 2, y1 = 4

Q3) Solve the recurrence relation ak + 4ak −1 + 4ak −2 = k 2 −3k + 5 with

a0 = 0 and a1 = 1.

Q4) State and prove De’ Morgan’s laws of Boolean algebra.

Q5) Express f (x , y , z , t ) = (x ′, y + xy z ′ + x y ′ z + x′ y ′ z ′ t + t ′ )′ in conjunctive

normal form.

Q6) Simplify the circuit.

Q7) Use mathematical induction to prove that

1 1 1 1 n
+ . + . +−−−+ =
1.3 3 5 5 7 (2n − 1)(2n + 1) 2n + 1
Q8) If f (x) = x2 - 3x + 1, g(x) = 2x - 3. find fog, gof, fof and gog.

Q9) Let a relation R be defined on N x N by (a, b) R (c, d) iff ad = bc, prove that
R is an equivalence relation.

J-3656[S-1512] 2
Q10) In a group of students,100 students know English, 50 know Hindi and 25
know both. Each of the students knows either Hindi or English. How many
students are there in the group?

Q11) State and prove Distributive laws of set theory.

Q12) Prove that [((~ p ) Λ q ) Λ (q Λ r )] Λ (~ q ) is a contradiction.

Q13) Prove that nc + nc = n+1c

r r −1 r

J-3656[S-1512] 3