Scribd
Upload
171 views4 pages

MCS 033

This document contains a practice exam for an Advanced Discrete Mathematics course. It includes 6 questions testing concepts like generating functions, graph theory, recurrence relations, and more. The exam has a maximum of 50 marks and covers topics such as: 1) Solving recurrence relations and determining if they are homogeneous or non-homogeneous. 2) Defining graph theory terms like complete graphs, regular graphs, and bipartite graphs. 3) Finding Euler paths and circuits in graphs. 4) Solving word problems involving properties of graphs like the relationship between the sum of vertex degrees and number of edges.

Uploaded by

tanuj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
171 views4 pages

MCS 033

This document contains a practice exam for an Advanced Discrete Mathematics course. It includes 6 questions testing concepts like generating functions, graph theory, recurrence relations, and more. The exam has a maximum of 50 marks and covers topics such as: 1) Solving recurrence relations and determining if they are homogeneous or non-homogeneous. 2) Defining graph theory terms like complete graphs, regular graphs, and bipartite graphs. 3) Finding Euler paths and circuits in graphs. 4) Solving word problems involving properties of graphs like the relationship between the sum of vertex degrees and number of edges.

Uploaded by

tanuj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

0 4852

No. of Printed Page : 4 MCS-033

MCA (REVISED)

Term-End Examination, 2019


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) Find the generating function of : [3]

0, 1, —2, 4, --8

(b) The sum of degrees of all vertices in a graph G is


equal to twice the number of edges in G. Prove
this statement. [3]

(c) Find the order and degree of the following


recurrence relation. Also state are they
homogeneous or non-homogeneous : [6]

(i) an = anao + + • • • + aoan (n 2)

(ii) a„ = +

MCS-033 (1) [PTO.]


(d) Define : [3]

(i) Complete Graph

(ii) Regular Graph

(iii) Bipartite Graph

(e) Solve the recurrence relation an = + an-2


with ao=0,ai= 1. [3]

(f) Draw the minimum spanning trees of the following


graph : [2]

2. (a) Solve the recurrence relation [5]

a„ — 5an_i + 6 an-2 = 7"

(b) Determine whether the graphs are isomorphic :

[5]

MCS-033 ( 2)
3. (a) Solve the recurrence relation : [5]

an —3an_i - 4a„_2 =

(b) Show that C6 is bipartite and k3 is not bipartite.[5]

4. (a) Find the chromatic number of the given graph :


[2]

(b) Solve the recurrence relation : [4]

an - 5an_1+ 6a,„2 =0 with ao = 2,a1 =

(c) What is spanning tree ? Give example. [4]

5. (a) Find Euler's path in the graph given below : [3]

MCS-033 ( 3 ) [P.T.O.]
(b) Solve : [4]

a„ = 6a„_, —11a„_2 +

with ao = 2, al = 5, a2 =15

(.c) What is the difference between an Hamiltonian


circuit and Eulerian circuit ? [3]

MCS-033 (4) 5000

You might also like