Professional Documents
Culture Documents
of Printed Pages : 4
BCS-012
BACHELOR OF COMPUTER
APPLICATIONS (Revised)
t_n
Term-End Examination
cC
O
December, 2013
BCS-012 : BASIC MATHEMATICS
Maximum Marks : 100
Time : 3 hours
1.
(a)
(b)
a b c
b+c c+a a+b
Show that c+a a+b b+c =2
c a
a b
a+b b+c c+a
If A = [2
1
3] and B= 3
1
check
whether AB = BA.
(c) Use the principle of mathematical induction
to show that 1 + 3 + 5 +
+ (2n 1) = n2
for each ne N.
(d) If a and 13 are roots of x2 3ax + a2 = 0 and
, 7
13 = 9 , find the value of a.
BCS-012
5
5
P.T.O.
2.
(e)
dy
2 d 2y +x
-y=0
If y=ax+ -, show that x
x
dx
d x2
(f)
(g)
If
, show
7. = 5 7 -
_ 3 7( and
=7.
31
-1 2 0
If A= -1 1 1 , show that A2 = A- 1
0 1 0
3 4 -5
(b) Show that A= 1 1 0 is row equivalent
1 1 5
(a)
If A
=[ 2 3],
show that
-1 2
10
(a)
BCS-012
(b)
If
x+iy-
(x2 + y2)2 -
4.
\la+ib
,
c+id
show
that
a 2 +b 2
2 .32
C +u
3x-1 <5
2
(c)
(d)
(a)
function
f (x) -
1- x + x
increasing or decreasing.
(b)
XER is
1
maximum at x=.
e
5.
(c)
(d)
(a)
(b)
a b
Show that [axb bxc cxa] = [-
BCS-012
P.T.O.
BCS-012