Scribd
Upload
2 views

Analysis of design and algorithm question bank

This document is a tutorial and assignment sheet for the Analysis and Design of Algorithms course at C Byregowda Institute of Technology. It includes various questions and tasks related to algorithm concepts such as dynamic programming, graph algorithms, Huffman trees, backtracking, and sorting methods. The assignments require implementations, explanations, and applications of specific algorithms on given data and graphs.

Uploaded by

manasavishwakarma03
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
2 views

Analysis of design and algorithm question bank

This document is a tutorial and assignment sheet for the Analysis and Design of Algorithms course at C Byregowda Institute of Technology. It includes various questions and tasks related to algorithm concepts such as dynamic programming, graph algorithms, Huffman trees, backtracking, and sorting methods. The assignments require implementations, explanations, and applications of specific algorithms on given data and graphs.

Uploaded by

manasavishwakarma03
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
You are on page 1/ 2

C BYREGOWDA INSTITUTE OF TECHNOLOGY

DEPARTMENT OF CSE and Comp. Engg


Tutorial Questions / Assignment - 2
Date: 28/04/2025
SUB: Analysis and Design of Algorithms (BCS401) Sem: 4th SEM
Module-4
1. Illustrate the concept of Dynamic programming with an example, how it is different from greedy
technique.
2. Implement Floyd's algorithm to find the All-Pairs Shortest Paths and also Apply the same for given
Graph.

3. Define Transitive closure? Implement and Apply Warshall’s Algorithm to compute Transitive
closure for the graph.

4. Solve the 0/1 Knapsack Problem Using Dynamic Programming.

5 Implement and explain Kruskal’s method and also apply Kruskal’s algorithm to find the minimum
cost spanning tree for the following graph.

6 Implement and explain prim’s algorithm and also apply prim’s algorithm for the following graphs.
7 What are Huffman trees? Explain the different types of Huffman encoding. Construct Huffman
codes for the given data.

Encode the following code DAD-BCE-DDA.


8 Write an algorithm to solve single source shortest path problem. Apply the algorithm to the graph
shown below by considering ‘a’ as source.

Module- 3 & 5
9 Write Horspool’s Algorithm for the Input Enhancement in String Matching. Consider searching for
the pattern QUITTERS in a text WINNERS NEVER QUIT AND QUITTERS NEVER WIN
that comprises English letters and spaces, construct suitable shift table and also apply algorithm to
find the pattern.
10 Develop Comparison Counting Sort Algorithm. Sort the elements 65 32 45 92 75 68 58 using the
same and also derive its complexity.
11 Describe the concept of Backtracking. Explain the sorting of four queens problem using back
tracking.
12 What is Backtracking? Write the Psuedocode for back-tracking algorithm. Let W = {3, 5, 6, 7} and
m = 15. Find all possible subsets of W that sum to m. Draw the state space tree that is generated.
13 Explain the following with example
(i) P Problems. (ii) NP Problems. (iii) NP-Hard Problems (IV) NP-Complete Problems.
14 Solve the given Knapsack problem using Branch and Bound Method.

15 Illustrate the concept Approximation algorithms for NP-Hard problems with a Knapsack problem.
16 Define Decision tree. Justify how decision trees can be used for searching a sorted array.
17 Draw decision tree for the tree-element selection sort and insert sort.

*****************************************

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy