Scribd
Upload
7 views2 pages

Data Structure Lab9

The document outlines an examination for the 2nd semester B. Tech students in Computer Science and Engineering, focusing on Data Structures. It includes tasks such as programming graph representations, performing breadth-first and depth-first traversals, implementing minimum spanning trees using Prim's and Kruskal's algorithms, and finding shortest paths using Dijkstra's algorithm. The exam is scheduled for 10th March 2025 and has a maximum duration of 2 hours.

Uploaded by

h.240103076
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
7 views2 pages

Data Structure Lab9

The document outlines an examination for the 2nd semester B. Tech students in Computer Science and Engineering, focusing on Data Structures. It includes tasks such as programming graph representations, performing breadth-first and depth-first traversals, implementing minimum spanning trees using Prim's and Kruskal's algorithms, and finding shortest paths using Dijkstra's algorithm. The exam is scheduled for 10th March 2025 and has a maximum duration of 2 hours.

Uploaded by

h.240103076
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

Department of Computer Science and Engineering

Branch: B. Tech (CSE/MNC/ECE/MAE) Semester: 2nd


Course Name: Data Structure Course Code: CS116
Maximum Time: 2 hours Date: 10th March, 2025

1. Write a program for the graph representation using adjacency matric and adjacency list
for the below graph.

2. Perform the breadth first traversal (BFT) for the below graph using Queue data structure,
and identify the correct sequence which is entered by user.
3. Perform the depth first traversal (DFT) for the below graph using stack data structure, and
identify the correct sequence which is entered by user.

4. Implement the minimum spanning tree, along with minimum cost using (a) prims
algorithm (b) Kruskal algorithm for the following graph.
5. Identify the shortest paths from source to all vertices using Dijkstra's Algorithm for the
given graph.

You might also like