Scribd
Upload
20 views1 page

Discrete Structures

The document outlines the structure of the Second CIA Exam for the course MAT302: Discrete Structures, scheduled for March 2025. It includes two parts: Part A consists of five questions worth 10 marks total, while Part B contains four questions worth 40 marks total. Topics covered include mathematical induction, graph theory, and recurrence relations.

Uploaded by

chinnugeetha989
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
20 views1 page

Discrete Structures

The document outlines the structure of the Second CIA Exam for the course MAT302: Discrete Structures, scheduled for March 2025. It includes two parts: Part A consists of five questions worth 10 marks total, while Part B contains four questions worth 40 marks total. Topics covered include mathematical induction, graph theory, and recurrence relations.

Uploaded by

chinnugeetha989
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

<br>

School of Arts, Sciences, Humanities &


SASTRA Education.
Second CIA Examn -March 2025
Course Code: MAT302
Course Name: Discrete Structures
Duration: 90 minutes Max Marks: 50
PART A (Answer all the questions)
5 x
2= 10 Marks
1. Use mathematical induction to prove that n
+ 2n is divisible by 3,
n1,
|A particle is moving in the horizontal direction. The distance it travels in
each second is equal to two times the distance it travelled in the previous
2.
second. If a, denotes the position of the particle in the rsecond,
determine a,, given that ao =3 and ag 10.
=

3. |State and prove handshaking theorem.


Give two distinguishing differences between Eulerian and Hamiltonian
4. graph and draw the appropriate graph.
5. Prove that Kg,3 is non-planar graph.
PART B (Answer any FOURquestions) 4x 10 = 4O Marks
|Apply mathematical induction and show that
1.3.5..2n-1) 1
6. 2.4.6...(2n)
1,2,3 .c
Use the method of generating function and solve the recurrence relation ,n
7.
4an1-4a,- + 4";n2 2,given that a, 2 and a, 8.
= =

a
|(a) Üse Prim's algorithm to find
minimum spanning tree for the
weighted graph given in the figure.
(Sm)

Show that the following


statements are equivalent for any
connected graph G.
)Gis 2-colorable. (i) c ie bipartite. (ii) Every cycle
of G
has evên
|length. (5m)
9. State and prove Euler's (Euler's Polyhedron) formula.

10. Prove that every planar five colorable.


graph is

You might also like