12791 12791 12791 12791 12791 12791 12791 12791 12791

12791 Roll No.

12791 12791 12791 12791 12791 Total12791
No. of Pages
12791 : 02 12791

Total No. of Questions : 07

BCA (2011 & Onward)
12791 12791 12791 B.Sc.(IT)
12791 (201512791
Batch) (Sem.–1) 12791
12791 12791 12791

MATHEMATICS – I
Subject Code : BSIT/BSBC-103
12791 12791 12791 12791
Paper12791
ID : [B1110]
12791 12791 12791 12791
Time : 3 Hrs. Max. Marks : 60

INSTRUCTIONS TO CANDIDATES :

m
12791 12791 12791 12791 12791 12791 12791 12791 12791
1. SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks
each.
2.
o
SECTION-B contains SIX questions carrying TEN marks each and students have

.r c
to attempt any FOUR questions.
12791 12791 12791 12791 12791 12791 12791 12791 12791

12791 1.
12791 Solve the
12791following :12791

pe
SECTION-A
12791 12791

o
12791m 12791 12791

.r c
2

a
a) If A is the set of rational numbers and B = {x : x – 4x + 2 = 0} then find A  B,
A – B and B – A.
12791 12791 b) Give12791

reflexive.
r p
an example12791
of a relation12791
which is both

e
12791symmetric12791
and transitive12791
but not 12791

12791 12791
b
c) Show that we can have A  B = A  C even if B  C.
12791 12791 12791

a p
12791
d) Solve the recurrence relation of Fibonacci sequence.
12791 12791 12791

12791 12791 f) Prove that p  q =12791

12791 ~ (~ p  ~ q).12791 rp
e) Define adjacency matrix of a relation with example.

b 12791 12791 12791

g) Over the universe of books, define the propositions B(x) : x has a blue cover,
12791

M(x) : x is a mathematics book, U(x) : x is published in the United States. Translate

12791 12791 the12791
following into12791
words : 12791 12791 12791 12791 12791

i) (x ) ( M ( x)   B ( x ))
ii) (x) ( M ( x )  U ( x)  B ( x))
12791 12791 12791 12791 12791 12791 12791 12791 12791
h) Define Eulerian and Hamiltonian graphs.
i) Write any two properties of binary tree.
12791 12791 j) Define
12791 partition of a set with suitable
12791 12791 example.12791 12791 12791 12791

12791 12791 12791 12791 12791 12791 12791 12791 12791

12791 1 | M-10045
12791 12791 12791 12791 12791 12791 (S3)-349
12791 12791

12791 12791 12791 12791 12791 12791 12791 12791 12791

12791 12791 12791 12791 12791 12791 12791 12791 12791

SECTION-B
12791 12791 12791 12791 12791 12791 12791 12791 12791
2. a) Are the following arguments valid? If valid, construct a format proof, if not explain
with the reason.
If wages increase, then there will be inflation. The cost of living will not increase if
12791 12791 12791 12791 12791 12791 12791 12791 12791
there is no inflation. Wages will increase; therefore, the cost of living will increase.
b) Prove that (p  q)  r = p  (q  r) by the use of truth tables.
12791
3.
12791
a) Partition
12791
the set 12791
A = {0,1,2,3,4,5}
12791
with the12791
minsets generated
12791
by B1 =12791
{0,2,4}, 12791
B2 = {1,5}. How many different subsets of A can be generated from B1 and B2?
b) State and prove the DeMorgan’s laws.
n5 n3 12791
7n

m
12791 12791 12791 12791 12791 12791 12791 12791
4. a) Prove by mathematical induction that   is a natural number for all n  N.
5 3 15

o
b) Let C(x) : x is cold blooded, F(x) : x is a fish and S(x) : x lives in the sea.

.r c
12791 12791
i) 12791
Translate into 12791 12791
formula : Every 12791
fish is cold blooded. 12791 12791 12791

ii) Translate into English : (x)[ A( x )  (  M ( x ))].

12791 12791 12791

pe
12791 12791 12791

o m 0
12791
1
0 012791
1
0 0 0
12791

5.

p a .r c
a) Let R be a relation on the set {a1, a2, a3, a4} defined by the matrix 
1

0 0 0


r e
12791 12791 12791 12791 12791 12791 12791  0 1 012791
1 12791

12791 12791
b
i) Find M × M.
ii) Draw the digraph of R × R.
12791 12791 12791

a p
12791 12791 12791 12791

rp
b) Consider the relation r = {(i, j) : |i – j| = 2} on {1,2,3,4,5,6}
i) Is r reflexive?
12791 12791 ii) 12791
Is r symmetric?
12791

iii) Is r transitive?
iv) Draw the graph of r.
b
12791 12791 12791 12791 12791

12791 12791 12791 12791

6. a) Prove that an undirected graph 12791
G is connected12791
if and only if12791
G contains a12791
spanning 12791

tree.
b) Prove Euler’s formula for planar graphs.
12791 12791 12791 12791 12791 12791 12791 12791 12791
1 2 3 
7. a) Find the inverse of the matrix using Gauss Jordan Method  0 –2 6 
 0 0 –3
12791 12791 12791 12791 12791 12791 12791 12791 12791

 7 –3 –3
b) Write the matrix  –1 1 0  as a sum of symmetric and skew-symmetric
12791 12791 12791  –1 0 112791
12791  12791 12791 12791 12791

matrices.

12791 2 | M-10045
12791 12791 12791 12791 12791 12791 (S3)-349
12791 12791

12791 12791 12791 12791 12791 12791 12791 12791 12791