MEENAKSHI SUNDARAJAN ENGINEERING COLLEGE, CHENNAI-24.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

&
DEPARTMENT OF INFORMATION TECHNOLOGY

QUESTION BANK

Subject Code / Subject Name: CS8391-Data Structures

Year / Sem:II/III

UNIT IV - NON LINEAR DATA STRUCTURES – GRAPHS

Definition – Representation of Graph – Types of graph – Breadth-first traversal – Depth-first traversal –
Topological Sort – Bi-connectivity – Cut vertex – Euler circuits – Applications of graphs.
CO203.4 Implement and apply the non linear data structure GRAPH ADT to problem solutions.

PART A
Q. BT COMPE
QUESTIONS CO PO
No LEVEL TENCE
1. What is a graph and mention its types? BTL-1 Remember C203.4 PO1
2. Consider the graph given below. Find the adjacency BTL-3 Apply C203.4 PO1
matrix of it.

3. Find out the in-degree and out-degree of each node BTL-3 Apply C203.4 PO1
in the given graph

4. Create an undirected graph and its adjacency matrix BTL-3 Apply C203.4 PO1
for the following specification of a graph G.
V(G)=1,2,3,4 E(G) ={ (1,2),(1,3),(3,3),3,4),(4,1)} .
5. Differentiate BFS and DFS. BTL-4 Analyze C203.4 PO1,
PO2
6. What is meant by bi-connected graph. C203.4 PO1
BTL-1 Remember
7. Give the purpose of Dijikstra’s algorithm. BTL-2 Understand C203.4 PO1
8. Differentiate cyclic and acyclic graph. BTL-4 Analyze C203.4 PO1,
PO2
9. Classify strongly connected and weakly connected BTL-1 Remember C203.4 PO1
graph.
10. Illustrate an articulation point with example. BTL-2 Understand C203.4 PO1
11. Define the length of the graph. C203.4 PO1
BTL-1 Remember
12. Define minimum spanning tree. Give an example. C203.4 PO1
BTL-1 Remember
13. State the principle of Topological sorting. C203.4 PO1,
BTL-1 Remember PO2
14. Explain procedure for Depth first search algorithm. C203.4 PO1
BTL-1 Remember
15. Analyse the different ways of representing a graph. BTL-4 Analyze C203.4 PO2
16. Prove that the number of edges in a complete graph BTL-2 Understand C203.4 PO1
of n vertices in n(n-1)/2.
17. Assess the minimum number of spanning tree BTL-5 Evaluate C203.4 PO3
possible for a complete graph with n vertices.
18. What are Euler circuits? C203.4 PO1
BTL-1 Remember
19. Give two applications of graphs. C203.4 PO1
BTL-1 Remember
20. Give the ways in which a graph can be represented C203.4 PO1
with an example. BTL-1 Remember
21. What is topological sorting? C203.4 PO1
BTL-1 Remember
22. What is breadth-first traversal? C203.4 PO1
BTL-1 Remember
23. Define spanning tree of a graph. C203.4 PO1
BTL-1 Remember
24. List out the applications of depth first search. C203.4 PO1
BTL-1 Remember
25. Find the adjacency matrix and adjacency list for the BTL-3 Apply C203.4 PO1
following graph.

PART B
Q. BT COMPE
QUESTIONS CO PO
No LEVEL TENCE
 Describe in detail about the following BTL-2 Understand C203.4 PO1,
1 representations of a graph. i) Adjacency Matrix , ii) PO2
Adjacency List.
. i) Consider the given directed acyclic graph D. BTL-3 Apply C203.4 PO1,
2
Sort the nodes D by applying topological sort on PO2
‘D’.

ii.Consider the graph given below and show its

adjacency list in the memory.

Examine topological sorting of a graph G with BTL-2 Understand C203.4 PO1

3 suitable example.
Explain any one of the shortest path algorithms with BTL-2 Understand C203.4 PO1
4 suitable example.

Describe the Prim’s algorithm for minimum BTL-2 Understand C203.4 PO1,
5 spanning tree. Give an example. PO2
Differentiate depth-first search and breadth-first BTL-4 Analyze C203.4 PO1,
6 search traversal of a graph with suitable PO2
Discuss the algorithms for Breadth first Search and C203.4 PO1,
7 Depth First Search on a graph. BTL-2 Understand PO2
Give an example based on the algorithm.
Illustrate Kruskal’s algorithm to find the minimum BTL-3 Apply C203.4 PO1,
8 spanning tree of a graph. PO2,
Trace the algorithm for the following graph. PO3

9 Write a program to find an Euler circuit in a graph. BTL-3 Apply C203.4 PO1,
Trace the algorithm for the given graph. PO2
 Develop an algorithm to compute the shortest path BTL-6 Create C203.4 PO1,
10 using Dijkstra’s algorithm. Validate PO3
the algorithm with suitable example.

Explain the depth first approach of finding C203.4 PO1

11 articulation points in a connected graph with BTL-2 Understand
necessary algorithm.

i) Write short notes on Bi-connectivity. ii) Express C203.4 PO1

12 different types of graphs with example. BTL-2 Understand

i) Write procedure of Dijikstra,s Algorithm. ii) BTL-3 Apply C203.4 PO1,

13 Consider the_given graph. Determine the shortest PO2
distance to all other nodes using Dijikstra's
algorithm, starting at the vertex A.

Consider a directed acyclic graph D given below. BTL-3 Apply C203.4 PO1,
14 Sort the nodes of D by applying topological sort on PO2
D.

i) Define Minimum Spanning Tree (MST) BTL-3 Apply C203.4 PO1,

15 ii) For the given graph, use kruskal's algorithm to PO2,
 determine the MST PO3
iii) Evaluate the cost of MST. Write procedure.

Explain about Prim’s and Kruskal’s algorithms in C203.4 PO1,

16 detail. BTL-2 Understand PO2

Give an account of Euler circuits in the applications C203.4 PO1

17 of graph. BTL-2 Understand

Write and trace the following algorithms with C203.4 PO1

18 suitable example. BTL-2 Understand
i. Breadth First Traversal
ii. Depth First Traversal

PART C
Q. BT COMPE
QUESTIONS CO PO
No LEVEL TENCE
1. Consider the graph G given below. The adjacency BTL-3 Apply C203.4 PO1,
list of G is also given. Evaluate the steps needed to PO2,
print all the nodes that can be reached from the node PO3
H (including H itself).One alternative is to use a
depth-first search of G starting at node H.

2. i) Formulate the minimum spanning tree for the BTL-6 Create C203.4 PO3
following graph. ii) Generalize any two applications
of depth first search.
3. Using Dijkstra’s algorithm to find the shortest path BTL-3 Apply C203.4 PO2,
from the source node A. PO3

4. i) Explain weakly connected graph and C203.4 PO2,

strongly connected graph with example. BTL-2 Understand PO3
ii) State the various graph traversal
algorithm. Explain each in detail.
5. Apply depth first and breadth first search to the BTL-3 Apply C203.4 PO2,
complete graph on four vertices. List the vertices in PO3
the order they would be visited.