No.

of Printed Pages : 8

I MTE-13 I

BACHELOR'S DEGREE PROGRAMME (BDP)

Term-End Examination
n .1 F-72

June, 2014
ELECTIVE COURSE : MATHEMATICS
MTE-13 : DISCRETE MATHEMATICS

Time : 2 hours

Maximum Marks : 50
(Weightage : 70%)

Note : Question no. 1 is compulsory. Answer any

four
questions from question numbers 2 to 7.
Calculators are not allowed.
1. Which of the following statements are true and
which are false ? Justify your answer.
(i) For any graph G, t(G) = x(G).
(ii)

p (E) q

10

pAq

(iii) The coefficient of x10 in (1 + x5 +x10 +...)3is

10.
(iv) K is non-planar.
44
(v)

a = 2n an
+ 3a
n
n- 3 is a homogeneous
recurrence with constant coefficients.

2. (a) Let f : B2 -3 B be a function defined by

f(0, 1) = 1, f(0, 0) = 0, f(1, 0) = 1 and
f(1, 1) = 0. Find the Boolean expression in
DNF specifying f.
MTE-13

P.T.O.

(b) The number of bacteria in a colony triple

every hour. Set up a recurrence for number
of bacteria after n hours have elapsed.
(c) Use Fleury's algorithm to find an Eulerian
circuit in the following graph, specifying the
bridges you have used.

3. (a) Find the number of integer solutions of the

equation
x1 +x2 +x3 +x4 =7 when0
(b) Find the solution of the recurrence relation
- llan - 2 + 6an - 3
a n = 6a n - 1
with the initial conditions ao = 2, a l = 5 and
a 2 = 15.
(c) Draw three spanning trees of the following
graph which are non-isomorphic to each
other :
C
A
B<
E

4. (a) Test the validity of the following argument

using a truth table :
"If there is a football match, then travelling
is difficult. If they arrived on time, then
travelling was not difficult. They arrived on
time. Therefore, there was no football
match."
MTE-13

(b) Find the generating function for the

sequence of the number of partitions of n
into distinct primes.
(c) How many positive integers not exceeding
2000 are divisible by 7 or 11 ?
5. (a) Explain each of the following with an
example :
(i) Modus ponens
(ii) Disjunctive syllogism
(b) If a pair of dice is rolled, what is the
probability that the sum on the two dice is
even ?
(c)

6.

Find the chromatic number of the following

graph :

(a) Find the Boolean expression corresponding

to the following logic circuit :

MTE-13

P.T.O.

(b) Draw 8 non-isomorphic trees on 7 vertices.

(c) Using generating functions, find a solution of
the recurrence relation a n = 2a n - 1 + 3an - 2
with ao = ac--- 1, n 2.
7. (a) Use mathematical induction to prove that
(n + 1)2 < 2n2 for n > 3.
(b) How many partitions of 2n + 1 are there
which have only the numbers 1 and/or 2 as
parts ?
(c) Four persons were found in a queue,
independently on 25 occasions. Show that at
least on two occasions they must have been
in the queue in the same order.
4a2 where
(d) Solve the recurrence a2+1
n
a > 0 and a0 = 2.
n

MTE-13

chitistim (fr.t.ft.)

liftUT

2014
1457,

: 4i

.t .t-13 :ti +am

FII27: 2 WI

31rETWR77 31W: 50

(yff WTI: 70%)

71F: 3T ZT. 1 WRT 31gdTeiF / 5177
2 7 Ti 4
W7T
W4q- / 4, M (-?e chI YeIT
3.7j-g&
I

1. Pis-iRiRld A -4 44J4
t ? aTcr4
(i)

q*
=tr-A7
--

-4-41 ;W-t) G

A(G)= x(G).

pAq
(iii) (1 + x5 + x10 +
(ii)

10

p q

x10

lot I

(iv) K4,4 3-1T(Ird4r4

(v)

2.

an = 2"a_ 1 + 3an _ 3 3W 74-4 414t

(-14-NIcI 771% t I

() ITT4
f: 2 ---> , f(0, 1) =- 1, f(o, =- 0,
f(1, 0) = 1 311T f(1, 1) = 0 gikitfit4T1517 1:507 t I
f
far-41t2 -.T4
DNF Vtzf 04,11ch
trf-A7

MTE-13

P.T.O.

(W 1T R-

(=tai'kqi
tvIK fcrafk4-41
2114

H-Y4i
v,q)'wf-ACC-0 I n

A-RI
T2ITRIff - f

(11)

3-1-1zr--4t Tem 711(1 ctA

A7 I WA.
.0-11)Ruf f45.1 TzT)T1W1ft etdi I
Tf rT

F-11-1R1 tgcl 4,114)

3. () ti~Il chtuI
Ac

x1

c-1.1

711c1

V 1<i<4

A'tf-A7

Trfd-- 4q1 ao = 2, al= 5 alt( a2 = 15 al

1
-4k* i:%T an = 6an-1- llan-2 + 6an-3
Iitf

chi (.4 711ci

11
$R I

(T) 12-11-11C1Rgcl 4,1141

3T-1
---tr*-Ret :

4)-1

A C
B<
E D
4. ()

MTE-13

- f5 Pi-iro (go d4
TrrTuft qikl AN 411
:
H1-4
e&R.
.1111
Ar4t,
-1 11 ti
4-I NI
zifq Nom( ":1-T
211 I"
410.
-T1Trzi 'TT 'TO I 3Tff:TE-

(I) 3Tffrf-afffri 31ITFT w9e-41311

-1(.9411 r 34--jwIT 711cf cbk4
-t-r
-7 I

fq4)

vcr

A-ta,

2000 doh .474 tr4R1

. :1- Tuft 7 TTT 11
foTrf4a.
5.

-> .3qwul

(i)

P:FE

l I c1 I t I P:Wi 14-11
zn-TTTF
61,11 ?

fdtrT i tgl+)(1-1111-{H
raqTAci (-14) (-0-ileicilem)

tit4

chl

(TT)

PIHR-liZgo

6.

-afft ki(seir Tito

tgd lctritERT

4trA7

-11 11 VtZi 04-01* Vd

2

MTE-13

P.T.O.

(TI) 7

4141 "cR 8 3-11-elr*--t

c1-11V I

TTT

(TI)

an = 2an - 1 + 3an - 2' a0 = a l = n> 2

7. (q)

old :TA7 I

-3111TI:R qiki -rFrz *tr-A7

n>3
(11- ) 2n + 1
4-)ad

(n + 1)2 < 2112.

1
-411ffq
1 ATArr 2

tr

(11) 25 31-44 97 iiiffi 14 .q1T

9114-1

3tR -ut
A
51-0-1 .11-1 -5114-fr31--4R1 1TT
i) 1 -Orr I

= 4a 2n
a 2n+1

A
2

al-4w

5b

fqUr
ti-k A -g-t
2

:
a>0 3

--Er

t4 LIR Ilkis .NR1

(v)

MTE-13

-N44 1-0
*qt t

2
a=2
0

2,000