Scribd
Upload
17 views3 pages

B TECH CSE-All SoCS branches-III-Discrete Mathematical Structures

This document is an examination paper for the course 'Discrete Mathematical Structures' at the University of Petroleum and Energy Studies, intended for B.Tech students in their third semester. It consists of three sections: Section A with short answer questions, Section B with longer problems, and Section C with more complex tasks, covering various topics in discrete mathematics and graph theory. The exam is scheduled for December 2019, with a total of 100 marks available.

Uploaded by

praanjaljain29
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
17 views3 pages

B TECH CSE-All SoCS branches-III-Discrete Mathematical Structures

This document is an examination paper for the course 'Discrete Mathematical Structures' at the University of Petroleum and Energy Studies, intended for B.Tech students in their third semester. It consists of three sections: Section A with short answer questions, Section B with longer problems, and Section C with more complex tasks, covering various topics in discrete mathematics and graph theory. The exam is scheduled for December 2019, with a total of 100 marks available.

Uploaded by

praanjaljain29
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/ 3

Name:

Enrolment No:

UNIVERSITY OF PETROLEUM AND ENERGY STUDIES


End Semester Examination, December 2019
Course: Discrete Mathematical Structures Semester: III (2019-2020)
Course Code: CSEG 2006 Time: 03 hrs.
Programme: B.Tech (All SoCS Branches) Max. Marks: 100
Instructions: Attempt all questions from Section A (each carrying 4 marks); all questions from Section B (each
carrying 10 marks) and all questions from Section C (carrying 20 marks).
SECTION A
S. No. Marks CO
Q1 Check whether the set of all integers is a countable infinite set or not. Give the
4 CO1
explanation.
Q2 Check whether the set of vectors (1, 2,3), (1, 1, 1), (3, 2,1), (2,1, 1) is basis or not
4 CO2
of 3 .
Q3 G is a non-directed simple graph with 12 edges. If G has 6 vertices each of 3 degrees
and the rest have the degree less than 3, determine the minimum number of vertices 4 CO3
G can have.
Q4 A tree has two vertices of degree 2, one vertex of degree 3 and three vertices of
4 CO4
degree 4. How many vertices of degree 1 does it have?
Q5 Check whether the transformation T : 3 ( )  3 ( ) defined as
4 CO2
T ( x, y, z )  ( x, y, kz ), k  is a linear transformation or not.
SECTION B

Q6 Using the decomposition theorem, determine the chromatic polynomial and hence the
chromatic number of the graph as shown below.

10 CO3

Q7 Using Dijkstra’s algorithm, determine the length of the shortest path between the
vertices e to f and hence the shortest path in the following graph.

10 CO3
Q8 Give an example of each graph which is (i) Cycle (C5) (ii) Eulerian (iii) Hamiltonian,
10 CO3
(iv) Eulerian but non-Hamiltonian and (v) Hamiltonian but non- Eulerian.
Q9 Determine the solution of the following non-homogeneous recurrence
10 CO1
relation yn  4 yn1  4 yn2  n2  3n  5, with y0  0, y1  1.
OR
Q9 Using the generating function method, determine the solution of the recurrence
relation with the conditions and 10 CO1

SECTION-C

Q10(A) Show that the set (V) of all m  n matrices with elements as real numbers is a vector
space over the field  , ,   with “addition of matrices” is the internal composition 10 CO2
and “multiplication of a matrix by a scalar” is the external composition in V.
Q10(B) Determine the maximum flow for the network as shown below using Ford-Fulkerson
algorithm. Determine the cut with capacity equal to this maximum flow.

10 CO4

Q11(A) Define graph vertex colouring. Explain Welch-Powell algorithm and using this
algorithm determine the coloring of the graph as shown below and hence find the
chromatic number  (G).

10 CO3

OR
Q11(A) Define isomorphism between two graphs. Determine whether the given pair of
graphs is isomorphic or not. Give the explanation.

10 CO3

Q11(B) Using Prim’s algorithm, determine a minimal spanning tree from the weighted graph as
given below

10 CO4

OR

Q11(B) Using Kruskal’s algorithm, determine a minimal spanning tree of the weighted graph
given below.

10 CO4

You might also like