17210 17210 17210 17210 17210 17210 17210 17210 17210

17210 Roll No.

17210 17210 17210 17210 17210 Total17210
No. of Pages
17210 : 02 17210

Total No. of Questions : 07

BCA (2011 & Onward)
17210 17210 17210 B.Sc.(IT)
17210 (201517210
Batch) (Sem.–1) 17210
17210 17210 17210

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

INSTRUCTIONS TO CANDIDATES :
17210 17210 17210 17210 17210 17210 17210 17210 17210
1. SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks
each.
2. SECTION-B contains SIX questions carrying TEN marks each and students have
to attempt any FOUR questions.
17210 17210 17210 17210 17210 17210 17210 17210 17210

SECTION-A
17210
1.
17210
Write briefly:
17210 17210 17210

o m17210 17210 17210 17210

.r c
a) Find (A B)C where :
A = {1, 2, 3, 4,}, B = {2, 4, 6, 8}, C = {7, 9, 6, 8}

m
17210 17210 17210 17210 17210 17210 17210 17210 17210

e
b) List the elements of the set B where N = {1, 2, 3, ...}and B = {x  N| x is even, x<11}

p
c) Define a reflexive relation by giving suitable example.
o
a .r c
17210 17210 d) Find the number of
17210 relations from
17210 A = {3, 4, 6}17210
17210 to B = {1, 2}.17210 17210 17210

p
e) Find the truth table of p q.

17210 17210 17210

b r
f) Define the tautology proposition.
17210
g) Define and draw directed graph.
17210 17210

p e 17210 17210 17210

h) Define and draw a tree.

a
rp
17210 17210 i) Define
17210 a recurrence relation.
17210 17210 17210 17210 17210 17210

b
8 0   1 7
j) If A = 3 5  and B   –2 6  find a matrix X such that A – 5x = 2B
17210 17210 17210 17210
3 2   3 4  17210 17210 17210 17210 17210

17210 17210 17210 17210 SECTION

17210 -B 17210 17210 17210 17210

2. Suppose a list A contains the 30 students in a mathematics class, and a list B contains
the 35 students in an English class, and suppose there are 20 names on both lists. Find
17210 17210
the number
17210
of students : (i) only on list
17210 17210
A (ii) only 17210
on list B (iii) on exactly one list.
17210 17210 17210

17210 1 | M-10045
17210 17210 17210 17210 17210 17210 (S3)-2133
17210 17210

17210 17210 17210 17210 17210 17210 17210 17210 17210

17210 17210 17210 17210 17210 17210 17210 17210 17210

17210 17210 17210 17210 17210 17210 17210 17210 17210

3. Prove the following by the principle of mathematical induction :
n(n  1)
1 + 2 + 3 + ... + n =
17210 17210 17210
2
17210 17210 17210 17210 17210 17210
4. Define a Hamiltonian graph. Find a Hamiltonian path or a Hamiltonian circuit, if it exists
in the following graph (Fig. 1)
17210 17210 17210 17210 17210 17210 17210 17210 17210

17210 17210 17210 17210 17210 17210 17210 17210 17210

17210 17210 17210 17210 17210 17210 17210 17210 17210

Fig. 1
 –2 2 1  3 2 1 

17210
5.
17210 17210 17210 17210

o m
Find the Product matrix BA where A =  2 1 2 and B  5 1 2
17210
 1 2 6 
17210
1 –2 1 
17210 17210

17210
6.
17210
A to17210
B: 17210 17210
.r c
a) Given A = {2, 3, 4 ,6} and B = {x, y, z }. Let R be the following relation from
17210 17210

m
17210 17210

p e
R = {(2, y), (2, z), (4, y), (6, x), (6, z)}
i) Draw the arrow diagram of R. (ii) Find the inverse relation of R.
o
a .r c
17210 17210 b) Consider
17210 the second-order
17210 homogeneous
17210 recurrence
17210 an = 2an–1 +17210
relation17210 an–2 with 17210
initial conditions

r p
a0 = 1, a1 = 2. Find the next three terms of the sequence.

e
17210 7
17210 a) Determine
17210

b
whether the proposition
17210 (pq) (pq)
17210

b) Consider the multigraphs 1, 2 and 3 in Fig. 2

1) Which of them are connected?
a p
17210 is a contradiction
17210 or not?17210 17210

2) 17210
Which are cycle-free (without cycles)?

rp
17210 17210 17210 17210 17210 17210 17210 17210

b
3) Which are loop-free (without loops?
4) Which are (simple) graphs?
17210 17210 17210 17210 17210 17210 17210 17210 17210

17210 17210 17210 17210 17210 17210 17210 17210 17210

17210 17210 17210 17210 17210 17210 17210 17210 17210

Fig. 2

17210 2 | M-10045
17210 17210 17210 17210 17210 17210 (S3)-2133
17210 17210

17210 17210 17210 17210 17210 17210 17210 17210 17210