Scribd
Upload
6 views

Data structure unit 5 imp

Uploaded by

sudheer01yadav2005
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Data structure unit 5 imp

Uploaded by

sudheer01yadav2005
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Rajarshi Rananjay Sinh Institute of Management & Technology

Amethi (U. P.)

Tutorial-5

Sub- Data Structure (BCS 301) Branch/ Year - CS & IT / 2 nd year

Short Questions

1. Write application of graphs?


2. Write different representations of graph in the memory.
3. What is transitive closure?
4. Compare adjacency matrix and adjacency list representation of graph.
5. Write application of BFS & DFS.

Long Questions

1. What is graph? Define their types? Explain in brief about representation of


graph.
2. What do you understand by graph traversal? Differentiate between BFS & DFS.
3. Write an algorithm for BFS and explain with the help of suitable example.
4. Perform DFS graph traversal on following:

7 2 10
71 14 3 5
8 12 12 1
4
3
87 4 5 2 20
6 6
5. What is minimum spanning tree? Write down Prim’s algorithm to obtain
minimum cost spanning tree. Use Prim’s algo to find minimum cost spanning
tree in the following graph:
4
B D
3
2 1 2
A 1
E
6 4
C G
2
2 1
F

6. Find the Minimum cost of given graph using Krushkal’s algorithm:

10
b e
4 8 6
7
a d
5 g
9
2 9
8 2
e f

7. Write short notes on transitive closure.


8. Describe Dijkstra algorithm to find shortest path.
1
A B
10
S 3 2 9 4 6

5 C D
2

9. Explain Warshall’s algorithm with the help of an example.

You might also like