Scribd
Upload
3 views3 pages

Algorithm Practical 2

This document outlines the practical examination for a Computer Science course, specifically for the 4th semester. It includes a set of programming tasks related to graph algorithms, such as implementing DFS, generating adjacency and incidence matrices, finding shortest paths using Floyd-Warshall and Dijkstra's algorithms, and determining minimal spanning trees using Prim's and Kruskal's algorithms. The total marks for the practical exam is 30, with specific distribution for source code, algorithm, output, sessional, and viva voce.

Uploaded by

aaishighosh2005
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
3 views3 pages

Algorithm Practical 2

This document outlines the practical examination for a Computer Science course, specifically for the 4th semester. It includes a set of programming tasks related to graph algorithms, such as implementing DFS, generating adjacency and incidence matrices, finding shortest paths using Floyd-Warshall and Dijkstra's algorithms, and determining minimal spanning trees using Prim's and Kruskal's algorithms. The total marks for the practical exam is 30, with specific distribution for source code, algorithm, output, sessional, and viva voce.

Uploaded by

aaishighosh2005
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

|Z(4thSm.)-Computer Sc.

-HVPr/CC-9PCBCS/Set-4

2023
COMPUTER SCIENCE HONOURS PRACTICAL
Paper : CC-9P
Full Marks : 30

SET - 4

Marks Distribution :
Source Code : 10
Algorithm: 05
Output : 05
Sessional 04
Viva vOce : 06

Answer any one question.

1. Write a Cprogram to implement DFS algorithm.

2. Write a Cprogram to generate the adjacency matrix and incidence matrix of the given graph.

10 20

30
E)
(A)
40
(D
(2) |Z(4hSm,)-ComputerSc.-H/Pr/CC-9PCBCS/Set-4
3. Write a Cprogram to find the all pair of shortest distance in the graph given below using
Floyd-Warshall algorithm.

B)

D) E

4. Write a Cprogram to find the shortest path between the vertices A and C of the below graph using
Dijkstra's algorithm.

A 20
(D)

30

and print the minimum cost


5. Write a C program to find the minimal spanning tree of the following graph
(weight) of the tree using Prim's algorithm.

4 B
(F 4

7 9
5 4

2 D) 10
(3) Z(4h Sm.)-Computer Sc.-H/Pr/CC-9P/CBCS/Set-4

the following graph and print the minimum cost


6. Write a C program to find the minimal Spanning tree of
(weight) of the tree using Kruskal's algorithm.
A

D (E F
3 3
2

2
H 3

You might also like