Scribd
Upload
59 views3 pages

Math1051 - Graph Theory

The document provides instructions and questions for a Graph Theory exam for a B.Tech degree. It includes definitions and problems related to graphs, trees, matrices, and mathematical expressions in prefix and postfix notation.

Uploaded by

Purahar sathya
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
59 views3 pages

Math1051 - Graph Theory

The document provides instructions and questions for a Graph Theory exam for a B.Tech degree. It includes definitions and problems related to graphs, trees, matrices, and mathematical expressions in prefix and postfix notation.

Uploaded by

Purahar sathya
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

[July-22]

GITAM (Deemed to be University)


[MATH 1051]
B.Tech. Degree Examination
CSE,CSE(AIML,CS,DS,IoT)
II Semester
GRAPH THEORY
(Effective from the admitted batch 2021–22)
Time: 2 Hours Max.Marks: 30
---------------------------------------------------------------------------------------------------
Instructions: All parts of the unit must be answered in one place only.
Figures in the right hand margin indicate marks allotted.
---------------------------------------------------------------------------------------------------
SECTION-A
1. Answer All the Questions: (51=5)
a) Define finite graph and infinite graph.
b) Define Adjacency Matrix.
c) Define a closed path.
d) Define a binary tree with example.
e) Define postfix notation.
SECTION-B
Answer the following: (55=25)
UNIT-I
2. Find the degree of the vertices v1 , v2 , v4 , v5 to the following graph.

Page 1 of 3
OR
3. Prove that the sum of the degrees of all vertices sin a graph G is twice
the number of edges in G.
UNIT-II
4. Obtain the adjacency matrix or the following graph.

OR
5. Obtain the incidence matrix for the following graph.

UNIT-III
6. Draw a picture of the following graph G = {V,E}, where V = {a,b,c,d,e}
and E = {(a,b), (a,c), (a,d), (a,e), (e,c), (c,a)} and state whether it is
Page 2 of 3
directed or undirected.

OR
7. Explain the Konigsberg Bridge Problem.
UNIT-IV
8. Explain Kruskal’s Algorithm for finding minimal spanning tree.
OR
9. Define a tree, a rooted tree, trivial and non-trivial trees with examples.
UNIT-V
10. What is the value of the prefix expression
+*235/234
OR
11. What is the value of the postfix expression
723*49 3 / +

[3/II S/122]

Page 3 of 3

You might also like