Scribd
Upload
2 views2 pages

Module-4 Question Bank

The document is a question bank for the subject 'Analysis and Design of Algorithms' for the 4th semester, focusing on various algorithms such as Dynamic Programming, Kruskal's, and Prim's algorithms. It includes questions on constructing minimum cost spanning trees, finding shortest paths, and generating Huffman codes. Each question is categorized by its corresponding course outcome (CO), difficulty level, and marks allocation.

Uploaded by

sushma.aids
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views2 pages

Module-4 Question Bank

The document is a question bank for the subject 'Analysis and Design of Algorithms' for the 4th semester, focusing on various algorithms such as Dynamic Programming, Kruskal's, and Prim's algorithms. It includes questions on constructing minimum cost spanning trees, finding shortest paths, and generating Huffman codes. Each question is categorized by its corresponding course outcome (CO), difficulty level, and marks allocation.

Uploaded by

sushma.aids
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Subject Name: Analysis and Design of Algorithms Subject Code:

BCS401 SEM: 4th DIV: A


Faculty: SUSHMA M

Module-4 Question Bank

SL# Question CO Level Marks


1. Define Dynamic Programming. Explain how to solve coin-row CO4 L2 05
problem using dynamic programming.
Construct minimum cost spanning tree using Kruskals
algorithm for the following graph.

2 CO4 L3 10

3. Write prim’s algorithm and find shortest path for the given graph CO4
using same algorithm?

L3 10

4. Write prim’s algorithm and find shortest path for the given graph CO4
using same algorithm?

L3 10

5 Write kruskal’s algorithm and find shortest path for the given CO4
graph using same algorithm?

L3 10

6 CO4
10,4,22,8,5,15,7 obtain a set of Huffman codes for seven
messages(M1…M7) Draw the decode tree for this set of codes?
L3 10
4. Define minimum spanning tree. Write Kruskal's algorithm to
find minimum spanning tree. Illustrate with the following
undirected graph.

CO4 L3 10

Faculty Signature

You might also like