No.

of Printed Pages : 2 MCS-033

MCA (Revised)
if) Term-End Examination
If)
December, 2012
0
MCS-033 : ADVANCED DISCRETE
MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Find the order and degree of the following 6

recurrence relation. Also state are they
homogeneous or non homogeneous ?
(i) an =3 an + n2
(ii) an = a n _ + an _ 2
(b) Construct a 5-regular graph on 10 vertices. 3
(c) Show that C6 is bipartite and K3 is not 3
bipartite.
(d) What is a spanning tree ? Illustrate with an 2
example and a non-exemplar each.
(e) Solve the recurrence an = a n _ 1 + 2 ; ao = 3 3
(f) Find the sequence generated by the 3
following :
5x2 (1- x) -1

MCS-033 1 P.T.O.
2. (a) Solve a,= a,_1 +r2 ; ao = 7 by substitution
method.
(b)- State and Prove Euler's formula for graph.

3. (a) Solve the recurrence relation described as

follows :
an =5 an _1 — 6 an _ 2, for n?.- 2, a0 =1, a1 =0
(b) Solve : a,— 7a,_1 +10a,_ 2 = 0, r ?- 2

4. (a) Use Substitution method to solve the

following :
to =1, n=2 and to =2 tn _ 1 +1, n>2
(b) Use generating function to solve
an =3 an _ 1 + 2, n,1 with a0 =1
(c) Illustrate Cutpoint using an example.

5. (a) Determine whether, the following graph

has an Euler path or Eulerian Circuit ?
E

A
(b) Determine the chromatic number of the
complete graph Kn with n vertices.
(c) Show that K5 is non-planar.

MCS-033 2
 No. of Printed Pages : 3 MCS-033

MCA (Revised)
LC")
cc Term-End Examination
s.0 December, 2013

MCS-033 : ADVANCED DISCRETE

MATHEMATICS
Time : 2 hours Maximum Marks : 50
Note : Question no. 1 is compulsory. Attempt any three
questions from the rest.

1. (a) Define : 4
(i) Graph (ii) Simple Graph
(iii) null graph (iv) connected Graph
(b) Find the order and degree of the following 6
recurrence relations. Determine whether they
are homogeneous or non homogeneous .
(i) an = 2an _ 1 + 3.2n
(ii) an = 8an2 —16an.4
(c) Solve the following recurrence relation : 3
a n — 5a n _1 +6a n _ 2 = 0 where a0 = 2,
a1 = 5.
(d) Define 8(G) and A(G) for a graph G 2
(e) Define walk, path and circuits in a graph. 3
(f) What is the generating function for the 2
sequence 1, 1, 1, 1, 1, 1, 1 ?

MCS-033 1 P.T.O.
2. (a) Solve the recurrence relation, an = 6 an _1 5
—11a n _ 2 + 6a n _ 3 with the initial
conditions a0 =2, al =5 and a2 =15.
(b) Define Bipartite graph. Show that every two 5
chromatic graph is Bipartite.

3. (a) Show that the graph given below is not 3

Eulerian.

(b) Solve an+i -an=n with a0=1 using method 5

of generating functions.
(c) Find the chromatic number of the given 2
graph.

4. (a) Show that k3 3 is non planar. 3

(b) Are the following graphs isomorphic ? If 4
Yes or No justify.

a e

(c) Solve an-2an_1=7n, 3

MCS-033. 2
5. (a) Solve the recurrence relation 5
a n — 3a n —1 + 2a n — 2 = 2n
(b) A connected planar graph has six vertices
each of degree 4. Determine the number of
regions into which this planar graph can
be split.

MCS-033 3
No. of Printed Pages : 3 MCS-033

MCA (Revised)
Term-End Examination
December, 2014

MCS-033 : ADVANCED DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question number 1 is compulsory. Attempt any
three questions from the rest.

1. (a) Differentiate methods of 'inspection' and

`telescoping sums' on relevant attributes.
Cite an example application for each. 4

(b) Explain the Tower of Hanoi problem with

an example. 4

(c) Suppose that the sequence {an} n 0, has

the generating function A(z). Then, the
generating function B(z) for the sequence
{bn} n 0, where bn = an — an_i for n 1,
B(z)
and by = a0, is given by = (1— z). 4
A(z)

(d) State and prove Handshaking theorem. 4

MCS-033 1 P.T.O.
 (e) Find the chromatic number of the following
graph : 4

2. (a) Show that Ii5 is not planar.

(b) Which of the following graphs are trees,
and why ? 5

(a)

(c) (d)
3. (a) Show that for a sub-graph H of a Graph G,
Ali_..AG. 5
(b) Solve the recurrence relation
un = 2 un_i + 2n — 1 where n 1 and
110 = 0. 5
MCS-033 2
4. (a) Evaluate the sum E n

k=1
k 3k C(n, k), using

generating function technique. 5

3n
(b) Prove that an = — – 2 is a solution of the
2
recurrence an = 2a(n/2 ) + 2, where n is a
power of 2 and a2 = 1.

5. (a) Solve the third order recurrence

un – 9 un _ i + 26 un _ 2 – 24 un _ 3 = 0,
where n ?_ 3 with the initial conditions
up = 6, ill = 17 and u2 = 53. 5
(b) Anil takes a loan of r rupees which is to be
paid back in t months. If i is the interest
rate per month for the loan, what constant
payment p must he make at the end of
each period ?

MCS-033 3 11,000
 No. of Printed Pages : 3 MCS-033

cN1 MCA (Revised)

00 Term-End Examination
C\1
O June, 2011

MCS-033 : ADVANCED DISCRETE

MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three from

the rest.

1. (a) Find the order and degree of the following 6

recurrences relations.
Determine whether they are homogeneous
or non homogeneous :

(i) an an-i +an-2+ + ao

(ii) an = flan _ 2 + 2n
(b) A graph G is said to be self complementary
4
if it is isomorphic to its complement
Show that for a self complementary (p - q)
graph G, either P or (P -1) is divisible by 4.
(c) Define minimum vertex degree of G (b(G)) 3
and maximum vertex degree of G (A(G)).

MCS-033 1 P.T.O.
 (d) Solve the following recurrence relation : 3
4ar -5ar _1 =0, r,1, a0 =1.
(e) Find the generating function for the 2
sequence 02, 12, 22, 32,
(f) Define bipartite graph Also give an 2
example of it.

2. (a) Show that if G1, G2, ...., Gn are bipartite, 5

n
then UG is bipartite.
i=1
(b) Solve the recurrence 5
an =an _ 1 +2an _ 1,
with a0 = 0, = 1.

3. (a) Solve ar = ar +r 2r, given a0 = 1. 5

(b) Solve ar =2ar _ i + 1 with a1= 7, for r > 1, by 5
substitution method.

4. (a) Use generating function to solve 3

an + 20an _ 2 = 0, a0 = —3, a1= — 10.
(b) Solve the recurrence 4
ar — 4ar+ 3 + 6ar+2 — 4ar+i + 4ar = 0.
(c) Find Euler's path in the graph given below : 3
a

MCS-033 2
5. (a) Can a simple graph exist with 15 vertices, 3
with each of degree five ? Justify your
answer.
(b) Are the following graphs are isomorphic ? 4
If Yes or No Justify.
a

4
(c) Show that K5 is not planar. 3

MCS-033 3
 No. of Printed Pages : 4 MCS-033

MCA (Revised)

N- Term-End Examination
00 June, 2012
Fr) MCS-033 : ADVANCED DISCRETE
O
MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Using mathematical induction method, 4

show that T" = 2" —1, n 1, where Tn
denotes the number of minimum number
of moves required to transfer n discs from
one peg to another under the rules of Tower
of Hanoi/Brahma.
(b) Find the generating function of the following 4
1
function ar = (r+ 1) ; r = 0, 1, 2, What

are combinatorial identities ? Explain with

an appropriate example.
(c) Let G be a simple graph with 6 vertices and 4
11 edges. Check whether the graph G is
connected or not.

MCS-033 1 P.T.O.
 (d) Find the degree of each vertex in the given 4
graph.

V5

(e) What is the complement of the given graph. 4

"1

2. (a) Determine whether the graphs are 5

isomorphic.

a b

MCS-033 2
 (b) A connected planar graph has six vertices 5
each of degree 4. Determine the number of
regions into which this planar graph can
be splitted ?

3. (a) Find the order and degree of the following 4

recurrence relation. Also find whether they
are homogeneous or non-homogeneous ?

(i) a n = sina n _ + cosa n _ 2 +sin

an _ 3 +....+ex

(ii) a n =n a n- 2 + 2n.

(b) Prove that the generating function for the 6

sequence of Binomial coefficients
fc (k, 0), c (k, 1) a, c (k, 2) a2, ...I is (1 + az)k.

4. - (a) Determine the chromatic number of the 4

following graph.

(b) Construct a non-Hamiltonian graph on 3

5-vertices.
(c) Check whether the complete graphs of 3
4 and 5 vertices are Eulerian.

MCS-033 3 P.T.O.
5. (a) Show that, in a connected Eulerian graph, 3
an Eulerian circuit can be traced starting
from any vertex.
(b) Solve the recurrence relation given as 4
follows : a n -5a n - 1 + 6 a n- 2 = 7n
(c) Draw a graph which is both regular and 3
bipartite ?

MCS-033 4
 No. of Printed Pages : 3 MCS-033

MCA (Revised)
0)
LO Term-End Examination
iczt-
ti June, 2014

MCS-033 : ADVANCED DISCRETE

MATHEMATICS
Time : 2 hours Maximum Marks : 50

Note : Question No. 1 is compulsory. Attempt any three from

the rest.

1. (a) Find the order and degree of the following 6

recurrences relations. Determine whether
they are homogeneous or
non-homogeneous.
(i) an = ao an _ + a a n-1± -F a n _ 1 a 0

(ii) an + an-1 = —1
(b) Define : 4
(i) Simple graph
(ii) Finite and infinite graph
(iii) Isolated vertex
(iv) Subgraph
(c) Solve the recurrence relation 3
an +1 — 1.5a n = 0
(d) Find the generating function of the following 2
a n =3n-F5n

MCS-033 1 P.T.O.
 (e) Find the chromatic number of the given 2
graph.

(f) How many edges are there in a graph with 3

10 vertices each of degree 6 ?

2. (a) Solve the recurrence relation 5

an — 6an _1 + 8an _ 2 = 3n
where a0 =3 and a1 = 7
(b) Draw a graph (connected) which can be 5
both regular and bipartite ?

3. (a) Find the solution to the recurrence relation 5

an = —3an_1-3an-2— an_ 3 with a0 =1,
a1 = —2, a2= —1
(b) Define Isomorphism of two graphs. Find 5
whether the given graphs are isomorphic
or not.

V
MCS-033 2
4. (a) Find Euler's path in the graph given 3
below :

(b) Show that k4 is planar graph. 3

(c) Solve the recurrence relation 4
an + 2an _ 1 + 2an _ 2 = 0 given that ao =0,
a1 = —1.

5. (a) Solve the recurrence relation 5

an+2-5an+1+6an = 2, a0 =1, a1 =2 using
the method of generating function.
(b) State and prove Hand Shaking Theorem. 5

MCS-033 3
 No. of Printed Pages : 4 MCS-033

MCA (Revised)
Term-End Examination
December, 2018

1 ..1 ,•
MCS-033 : ADVANCED DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Find the generating function of the

following : 3
2, 4, 8, 16, 32, ...

(b) Prove that the number of vertices of odd

degree in a graph is always even. 3

(c) Find the order and degree of the following

recurrence relation. Also state whether they
are homogeneous or non-homogeneous. 6

(i) an _1 ± an _ 2 an - 3 an - 4

(ii) dn = n _ + (— 1) 11

MCS-033 1 P.T.O.
 (d) Define :
(i) Walk
(ii) Path
(iii) Circuit
in an undirected graph. 3

(e) Solve the recurrence relation

ar = ar + 2ar _ 2 with ao = 2 and ai = 10. 3

(f) Is every subgraph of a regular graph

regular ? Justify. 2

2. (a) Find the solution of the recurrence relation

an = 3a n - 1 + 2n

(b) Determine whether the graphs are

isomorphic

vi V3 v4

MCS-033 2
3. (a) Solve the recurrence relation

Tn = 2Tn _ + 1 if n ?_ 2 and Ti = 1

using generating function.

(b) If an undirected graph has exactly two

vertices of odd degree there must be a path
joining these two vertices.

. (a) Find the chromatic number of the given

graph. 2

(b) Solve the recurrence relation by

substitution method 4
= a n-1 + n . 2n;

ao = 1

(c) What is connected graph ? Explain with

example. 4

MCS-033 3 P.T.O.
5. (a) Find Eulerian path in the given graph. 3
V8 V4

Vi V2

(b) Solve : 3
an - 2a n - 1 = 7n

(c) Given a connected planar graph with p = 4,

q = 6, calculate the number of regions r. 4

4 7,000
MCS-033
 No. of Printed Pages : 3 MCS-033

MCA (Revised)
kr) Term-End Examination
O
June, 2013
O
MCS-033 : ADVANCED DISCRETE
MATHEMATICS
Time : 2 hours Maximum Marks : 50
Note : Question no. 1 is compulsory. Attempt any three
questions from the rest.

1. (a) Find order and degree of the following 6

recurrence relation. Also, state whether they
are homogeneous or non-homogeneous.
(i) an = nan _ 2 -I- 211
an = an _ + an _ 2 .... + ao
(b) Is every subgraph of a regular graph 3
regular ? Justify.
(c) Draw three spanning tree of the following 3
graph :
A

E D
(d) What is a connected graph ? Explain with 2
an example and a non-examples each.
(e) Solve the recurrence relation : 3
an = 3an _1 + 1; ao = 1.

MCS-033 1 P.T.O.
 (f) Find the sequence generated by the 3
following :

1
+ 5z3
1-z

2. (a) Solve ar = ar-i -Fr.2r a 0 =1 by substitution 5

method.
(b) Show that maximum number of edges in a 5

n(n - 1)
simple graph with n vertices is
2

3. (a) Solve the recurrence relation given as 5

follows :
a n = 8a n-1 - 16a n-2 for n?- 2, ao = 16,
a l =80
(b) Solve the recurrence relation given as 5
follows :

a r+4 4a r+3 +6ar+ 2 -4a r+1 +4a r =0

4. (a) Use substitution method to solve t o =1, n = 0 4

and tn =2tn _ i, n?-1.
(b) Use generating function to solve 4

a n +2 - 2an+i -F a n=2n; au =2; a1 =1

(c) Define bridge in a graph. Also give an 2
example of it.

MCS-033 2
5. (a) Find that the graph has Eulerian Circuit or 3
not ?
V
V

V4 V5
(b) Find chromatic number of bipartite graph 4
Km, n.
(c) Show that K3, 3 is non-planar. 3

MCS-033 3
 No. of Printed Pages : 4 I MCS-033 I

MCA (Revised)
Term-End Examination
0 1 036 June, 2018

MCS-033 : ADVANCED DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Write the recurrence relation of Tower of

Hanoi problem and explain the
formulation. 4

(b) A person invested 10,000 @ 12% interest

compounded annually. How much will he
get at the end of 15 years ? (Solve using
recurrence relation only)

(c) Explain generating function. What type of

problems can be solved using generating
function for recurrence relation ? 4

MCS-033 1 P.T.O.
 (d) Is there a simple graph corresponding to
the following degree sequence : 4
(i) (1, 1, 2, 3)
(ii) (2, 2, 4, 6)
(e) For what value of n is the graph of K n
Eulerian? 4

2. (a) Find whether the following pair of graphs

are isomorphic or not. 5

(G) (G')

(b) The following graph contains no Euler

circuit. Give reasons.

MCS-033 2
3. (a) If G is a connected simple graph with
(h > 3) vertices and e edges then 5

e 3n — 6

(b) Consider the graph G. Use suitable graph

colouring algorithm to colour G and find
x (G). 5

.1107,An■
v7

4. (a) Solve

an + 2 5 an + 1 + 6an = 2

with initial condition ao = 1, a1 = —1. 5

(b) Determine the generating function of the

following sequence : 5

2r if r is even
ar =
— 2r if r is odd

MCS-033 3 P.T.O.
5. (a) Determine the number of integer solutions
to linear equation 5
x 1 + x2 - 3 with 0 x <— 1 and 0 x 2<-2.

(b) Show that a n = —2n + 1 is the solution of the

non-homogeneous linear recurrence
relation 5

an = 3an _ 1 + 2"

MCS-033 4 7,000
 C3 1_ 1 1 4

No. of Printed Pages : 3 I MCS-033

MCA (Revised)
Term-End Examination
December, 2015

MCS-033 : ADVANCED DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Define regular graph. Find the number of

edges of a 4-regular graph with 6 vertices.

(b) Find the order of the following recurrences

and state whether they are homogeneous
or non-homogeneous :
(i) xn+1 + an- 15xn_1 = 0
(ii) 3xn+1 - 7xn + 4xn_1 = 3 + 2n

(c) Solve the recurrence relation

xn+i - 8xn + 15xn _ 1 = 0, where Xo = 5 and
xl = 21. 4

(d) Find the generating function for the

sequence 0, 1, - 2, 3, - 4. 3

MCS-033 1 P.T.O.
 (e) Determine whether the sequence {a n) is a
solution of the recurrence relation
an = an_i + 2an_2 + 2n - 9, if an = - n + 2. 3

(f) Is a Hamiltonian graph Eulerian ? Is a

Eulerian graph Hamiltonian ? Show with
the help of a suitable example. 3

2. (a) Solve a n+1 = 5an for n 0, a0 = 2 by

Substitution method.
(b) Solve the recurrence
an - 7an_1 + 10an_2 = 0, n ?_ 2
by Characteristic root method.

3. (a) Solve the recurrence by using iterative

approach : 4
= an_i + 2n + 3, ao = 4.
(b) Find the sequence (a n) having the
generating function G given by
3 1
G(x) = + 4
1 - x 1- 2x
(c) Define isomorphic graph. Give an example
of the same.

4. (a) State Euler's formula for the graph.

(b) For the following graph G,

>.<
MCS-033 2
 draw subgraphs 3
(i) G - e
(ii) G - a
(c) Is a subgraph of a planar graph, planar ?
Justify your answer.

5. (a) Solve an = 4(an_1 - an_2) with initial

condition alp = 1, a1 = 1. 4
(b) For which value of m and n is I n
a tree ? 3
(c) Show that C 6 is a bipartite graph.

MCS-033 3 14,000
 No. of Printed Pages : 3 I MCS 033 I
-

MCA (Revised)
Term-End Examination
07-'5 4 6 December, 2016

MCS-033 : ADVANCED DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Using induction, show that

T= 2- 1, where n ?. 1,

where ; = + 1. 5

(b) Prove that the complement of G G.

(c) Draw at least 3 non-isomorphic graphs on

4 vertices. 5

3n
(d) Prove that an = — – 2 is a solution to the
2
recurrence an = 2a./2 + 2, where n is a
power of 2 and a2 = 1.

MCS-033 1 P.T.O.
2. (a) Find the number of bijections on a set of n
elements, where n 1. 5

(b) Consider the graph on 5 vertices and

7 edges given in the figure. Find x 1 to x5
walks of length 8 and length 4 respectively. 5
x4 x5

x3 112

3. (a) If G is a graph with n vertices and k

components, then prove that G can
have at least n — k edges and at most
1(n — k) (n — k + 1) }
edges. 5
2

(b) Solve the third order recurrence

Un — 9Un +1 26Un _ 2 - 24Un _ 3 = 0,
where n 3, with the initial conditions
1.10 . 6,Ui = 17 andU2 = 53. 5

4. (a) Solve the recurrence

dk =kdk _ i +(-1)kifk?_2 withd i = O. 5

(b) Find A. (G), where G is the Petersen graph. 5

MCS-033 2
5. (a) Draw three spanning trees of the following
graph : 3

(b) What is the difference between an Eulerian

graph and an Eulerian circuit ? 2

(c) Construct a graph with chromatic

number 5. 3

(d) Solve the recurrence relation an = a 1

for n = 2k, where k ?_ 1, a l = O. 2

MCS-033 3 8,500
 No. of Printed Pages : 3 I MCS-0331

MCA (Revised)
Term End Examination
-

1-3-? 1B June, 2016

MCS-033 : ADVANCED DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Is a tree a bipartite graph ? Justify. 3

(b) Are the following recurrence relations

homogeneous or non-homogeneous ? Give
the order of each. 4
(i) xn + 10xn + 22xn 1= 4
(ii) an = an - + an - 2 + a0

(c) Solve the recurrence relation

4an - 5an _ i = 0 for rt 1, ao = 1. 4

(d) Find the generating function for the

sequence 1, 1, 1, 0, 1, 1, .... 3

MCS-033 1 P.T.O.
 (e) Let an = 2n + 5 (3") for n = 0, 1, 2, ....

Show that an = 5an _ 1 — 6an _ 2 for all

integers n with n 2. 3

(f) E
n
Find the sumk 3 k C(n, k) by using
k =1
generating function. 3

2. (a) Solve an = an _ 1 + n, a0 = 2 by Substitution

method. 5
(b) Solve the recurrence relation
an — 9an _ 1 + 26an _ 2 - 24an _ 3 = 0, n 3
by characteristic root method. 5

3. (a) Solve the recurrence relation

an = 3an _ 1 + 1, a0 = 1 by using iterative
method. 4
(b) Draw K4 graph. Show that it is planar and
4-colorable. 4
(c) What do you mean by isomorphic graphs ? 2

4. (a) State Handshaking Theorem. 3

(b) A non-directed graph G has 8 edges. Find
the number of vertices, if the degree of
each vertex in G is 2. 3
(c) Construct a non-Hamiltonian graph on
5 — vertices. 4

MCS-033 2
5. (a) Find the number of vertices and number of
edges in complete bipartite graph Kin, n. 3

(b) Solve the recurrence

an — 4an _ 1 = 0 by Generating function. 4

(c) State whether the following graphs are

planar or not : 3

(i)

MCS-033 3 7,000
 No. of Printed Pages : 3 MCS-033 I

MCA (Revised)
Term-End Examination
June, 2017
ICC?
MCS-033 ADVANCED DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Find the order and degree of the following

recurrence relation. Also determine
whether they are homogeneous or
non-homogeneous. 6

(1) an = an _ + a.n _ 2 + + a0

(ii) an = nan _ + (—

(iii) an = an -1 + an _ 2

(b) Solve the following recursion relation using

characteristic equation :
tn = 4tn _ — 3tn _ 2 for n > 1
to = 0
ti = 1

MCS-033 1 • P.T.O.
 (c) State and prove the handshaking theorem. 5

(d) Define the following symbols :

(i) 8(G)
(ii) <S>G
(iii) Wn

2. (a) What is meant by complement of a graph ?

Find the complement of the C5 graph
(i.e. C5 ).

(b) What is a complete graph ?

(c) Find the generating function for the

sequence
0 2 , 12, 22 3
,
9 • •

(d) Determine the chromatic number of the

following graph : 2

3. (a) Solve the recurrence relation

an = an _ + 2, n ?_ 2. 6

(b) Prove that the degree of every vertex in a

connected Euler graph is even. 4
MCS-033 2
4. (a) Derive and explain the recursion relation
drawn from the analysis of Merge Sort
algorithm.

(b) Determine whether the following graph

has a Hamiltonian circuit and a
Hamiltonian path. Explain your answer.
a

5. (a) Show and explain that if G 1 , G2, ..., GN are

bipartite graphs, then U G i is bipartite. 5

i =1

(b) Show that K4 is a planar graph. 2

(c) Define isomorphism. Determine whether the

following pair of graphs are isomorphic :
v2

MCS-033 3,500
No. of Printed Pages : 2 I MCS-033 I

MCA (Revised)
Term-End Examination
002.7 0 December, 2017

MCS-033 : ADVANCED DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Using induction, verify that

,r6 f = (") ( 1- n1
2 2

where fn = fn _ 1 + fn _ 2 and fo = 0 and fi = 1. 5

(b) Determine the number of subsets of a set of

n elements, where n 5
(c) Find the sum of the series

E (k
00
+ 1)2 = 12
+
22
++
(n + 1)2
+
L a.
k=0

using exponential generating functions. 5

MCS-033 1 P.T.O.
 (d) Take three vertices x, y, z and draw all
possible (3, 2) graphs on these vertices. 5

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

linear equation
al + a2 + + ak = n,
using generating function techniques,
when ai O. 5

(b) State and prove the handshaking theorem. 5

3. (a) Solve the recurrence relation a 2 +1 = 5 an

where an > 0 and ao = 2. 5

(b) Construct a 5 regular graph on 10 vertices. 5

4. (a) Solve the linear recurrence

an an - = + 2 fn -1 n 1
where ao = 2 and fi denotes the ith
Fibonacci number. 5

(b) Show that for a subgraph H of a graph G,

A(H) A(G). 5

5. (a) Find all the graphs that have edge

chromatic number 1. 5
(b) Show that C6 is bipartite and K3 is not
bipartite. 5

MCS-033 2 7,500
No. of Printed Pages : 3 MCS-033 I

MCA (Revised)
Term-End Examination
June, 2015
06663

MCS-033 : ADVANCED DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question number 1 is compulsory. Attempt any

three questions from the rest.

1. (a) Explain divide and conquer relations with

an example. 4

(b) Find the order and degree of each of the

following recurrences : 4
(i) an' an-1+ an-2
(ii) an an-1 + n
(iii) an = n an_1 + (-1)n
(iv) an = an ao + an_i + + ao an(n > 2)

(c) Explain generating functions with suitable

examples.

MCS-033 1 P.T.O.
 (d) Define Graph and Subgraph. Give an
example of a subgraph H of a graph G with
8(G) < 8(H) and A(H) < A(G). 4

(e) Define Tree and Bipartite graph. Is tree a

bipartite graph ? Justify your answer.

2. (a) What are Hamiltonian graphs ? Construct

a non-Hamiltonian graph on 5-vertices. 5
(b) Show that K5 is not planar.

3. (a) What is the chromatic number of the

following :
(i) A tree with at least two vertices 2
(ii) An even cycle C 2n, n ? 2 2
(iii) An odd cycle C 2n+1 , n ? 1 2
(b) State and prove Euler's formula. 4

4. (a) Find the sum of the series given as,

00

+ 1)2 = 12 22 (n + 1)2
+...+
11 1St 11- La
k=0
using exponential generating functions. 5

(b) How many integer solutions are there to

a1 + a2 + a3 + a4 + a5 = 28, where ak > k for
each k, where 1 < k < 5 ?

MCS-033 2
5. (a) Solve the recurrence a n = 4an_2, where
(i) ao = 4, al = 6 2
(ii) ao = 6, a2 = 20 2
(iii) al = 6, a2 = 20 2

(b) Using an appropriate substitution, solve

the recurrence given by,
(n — 1) 1
Yn = Yn-1 n > 1,

where y = 5.

MCS-033 3 8,000
No. of Printed Pages : 4 I MCS-033 I

MCA (Revised)
O
00 Term-End Examination
O
December, 2011

MCS-033 : ADVANCED DISCRETE

MATHEMATICS
Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three

questions from the rest.

1. (a) Find the order and degree of each of the 4

following recurrence relation. Also find
whether they are homogeneous or
non-homogeneous ?

(i) an = a2n _ 2

(ii) an = an _1+ an-2 + a0

(b) Find the recurrence relation whose solution 3
is given by an = A-3n + B ( — 4)n,

(c) Solve the recurrence relation given by

an — 5an _ + 6an _ 2 =0
where ao = 2 and al =5.

MCS-033 1 P.T.O.
 (d) Draw the graph k2 5 3
(e) Show that for a subgraph H of a graph G, 4
(H) A (G)
(f) If a graph of n vertices is isomorphic to its
complement, how many vertices it must
have ?

2. (a) Determine whether the gra*phs are 4

isomorphic.

(b) Show that a graph G without parallel edges

or self loop with n vertices and
k components can have at most
(n—k) (n+ k =1)/ 2 edges.

3
3. (a) Check that an = 2 n-2 is a solution to the 5

recurrence a n =2a n/2 +2, where n is a

power of 2 and a2 =1.
(b) Solve the recurrence relation Tn = 2Tn4 +1 5
if n 2 and T 1 = 1, using generating
function.

MCS-033 2
4. (a) Show that the graph in the fig. given below 4
has a Hamiltonian circuit.

(b) What is the chromatic number of the 2

following graph ?

(c) Whether the following graph contains Euler

circuit or not ?

MCS 033
- 3 P.T.O.
5. (a) Solve the recurrence relation 4

2 =5 2 where a n > 0 and a0=2.

an +1 an
Find a8

(b) Show that K5 is not planar. 3

(c) How many integer solutions are there to 3

a l + a 2 + a 3 + a 4 + a 5 = 28 with a k > k for
each k, 1<k <5 ?

MCS-033 4