Scribd
Upload
3 views3 pages

Algorithm Practical 4

This document outlines a practical exam for a Computer Science Honours course, specifically for the CC-9P paper, with a total of 30 marks. Students are required to answer one question from a selection of programming tasks involving algorithms such as Prim's, Dijkstra's, DFS, Floyd Warshall's, Kruskal's, and BFS. The marks distribution includes source code, algorithm explanation, output, sessional marks, 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 4

This document outlines a practical exam for a Computer Science Honours course, specifically for the CC-9P paper, with a total of 30 marks. Students are required to answer one question from a selection of programming tasks involving algorithms such as Prim's, Dijkstra's, DFS, Floyd Warshall's, Kruskal's, and BFS. The marks distribution includes source code, algorithm explanation, output, sessional marks, 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(4th Sn.)-Computer Sc.

-HPr/CC-9P/CBCS/Set-1

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

SET - 1

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

Answer any one question.

1. Write a Cprogram to implement Prim's Algorithm on the following graph to generate Minimum cost
spanning tree.

4 5
3 6
-I/Pr/CC-9PPCBCS/Set-1|
(2) |Z(4h Sm,)-Computer Sc.
following graph
C program to implement a minimum cost path using Dijkstra's algorithm on the
2. Write a cost and vertices minimum cost path.
from'a' to 'g'. Output corresponding minimum

graph.
3. Write a C program to apply DFS algorithm on the following

4. Write aC program and apply Floyd Warshall's Algorithm to generate all possible shortest paths among
all pairs of two vertices on the graph given below. Output the shortest paths between each pair of
vertices.

12 13

11 12

2
(3) Z(4th Sm.)-Computer Sc.-H/Pr./CC-9P/CBCS/Set-l

graph using Kruskal's algorithm.


5. Write a C program to find minimum cost spanning tree from the given
E

16
17

6. Write aC program to apply BFS on the following graph and generate a tree.

You might also like