Scribd
Upload
2 views2 pages

Module-4 Question Bank

This document is a question bank for the Analysis and Design of Algorithms course at Sri Krishna Institute of Technology, focusing on various algorithmic concepts. It includes questions on dynamic programming, Huffman trees, Dijkstra's algorithm, and minimum spanning trees, among others. Each question is categorized by its corresponding course outcome and difficulty level, along with assigned marks.

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

This document is a question bank for the Analysis and Design of Algorithms course at Sri Krishna Institute of Technology, focusing on various algorithmic concepts. It includes questions on dynamic programming, Huffman trees, Dijkstra's algorithm, and minimum spanning trees, among others. Each question is categorized by its corresponding course outcome and difficulty level, along with assigned marks.

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

SRI KRISHNA INSTITUTE OF TECHNOLOGY

(Accredited by NAAC, Approved by A.I.C.T.E. New Delhi, Recognised by Govt. of Karnataka & Affiliated to V.T U.,
Belagavi)
#57, Chimney Hills, Hesaraghatta Main Road, Chikkabanavara Post, Bengaluru- 560090

Department of Artificial Intelligence and Machine Learning


Subject Name: Analysis and Design of Algorithms Subject Code:
BCS401 SEM: 4th DIV: A
Faculty: Prof. Manzoor Ahmed

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.
2. Write algorithm for Change Making problem. CO4 L2 05
3. Write the algorithm for Robot Coin Collection.
4. Write algorithm for 0/1 knapsack problem with memory CO4 L3 05
functions approach.
Construct minimum cost spanning tree using Kruskals
algorithm for the following graph.

5. CO4 L3 10

6. What are Huffman Trees? Construct the Huffman tree for the
following data.
Character A B C D E - CO4 L3 10
Probability 0.5 0.35 0.5 0.1 0.4 0.2
Encode DAD-CBE using Huffman Encoding.
7. Apply Dijkstra’s algorithm to find single source shortest path
for the given graph by considering S as the source vertex.

CO4 L3 10

8. Define transitive closure of a graph. Apply Warshalls algorithm


to compute transitive closure of a directed graph
CO4 L3 10

9. Define transitive closure. Write Warshall's algorithm to


compute transitive closure. Illustrate using the following CO4 L3 10
directed graph.
SRI KRISHNA INSTITUTE OF TECHNOLOGY
(Accredited by NAAC, Approved by A.I.C.T.E. New Delhi, Recognised by Govt. of Karnataka & Affiliated to V.T U.,
Belagavi)
#57, Chimney Hills, Hesaraghatta Main Road, Chikkabanavara Post, Bengaluru- 560090

10. Apply Floyd’s algorithm for the given graph.

CO4 L3 05

11. Define minimum spanning tree. Write Kruskal's algorithm to


find minimum spanning tree. Illustrate with the following
undirected graph.

CO4 L3 10

Character A B C D E -
12. Probability
Construct 0.5 0.35
the Huffman 0.5resulting
tree and 0.1 code0.4 0.2
for the following
data.
CO4 L3 10
Encode the text: ABACABAD
Decode the text: 100010111001010

Faculty Signature

You might also like