Scribd
Upload
11 views

DAA Unitwise Question Bank

This document is a unit-wise question bank for the course 'Design and Analysis of Algorithms' for B.Tech (CSE-AIML) students. It includes a comprehensive list of questions and algorithms related to various topics such as performance analysis, greedy methods, dynamic programming, graph algorithms, and NP-completeness. The document is structured into five units, each containing multiple questions aimed at assessing students' understanding of algorithm design and analysis.

Uploaded by

mybotemail8055
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
11 views

DAA Unitwise Question Bank

This document is a unit-wise question bank for the course 'Design and Analysis of Algorithms' for B.Tech (CSE-AIML) students. It includes a comprehensive list of questions and algorithms related to various topics such as performance analysis, greedy methods, dynamic programming, graph algorithms, and NP-completeness. The document is structured into five units, each containing multiple questions aimed at assessing students' understanding of algorithm design and analysis.

Uploaded by

mybotemail8055
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
You are on page 1/ 4

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Unit wise Question Bank

Course Name: DESIGN AND ANALYSIS OF ALGORITHMS Program B.Tech (CSE-AIML)

Faculty Name Mr. A. Satyam Regulation R20


Class III CSE-AIML-II Sem Academic Year 2024-25

Unit-1

1. Differentiate performance measurement and performance estimation of


Algorithms
2. What are the different mathematical notations used for algorithm analysis?
3. What is Performance Analysis? Explain Space Complexity and Time Complexity
with examples?
4. Compare the features of the algorithm with pseudocode.
5. Find the Space and Time complexity of the following code
int fun(int n)
{ int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;}

6. Develop an algorithm to solve the Towers of Honai problem with n disks with three
towers.

7. Write an algorithm for Binary search and analyze the algorithm for its time complexity

8. List and explain the characteristics of the algorithm.

9. Write Randomized algorithm for Quick sort. Analyze its performance with quick sort
algorithm without randomization.

10. Develop the randomised algorithm for primality testing.


Unit-2

1. Develop Greedy method control abstraction for the subset paradigm.


2. Explain the merge sort algorithm 310, 285, 179, 652, 351, 423, 861, 254, 450,
520. Derive the time complexity from T(n)=2T(n/2) +cn
3. Write and explain the general method of divide-and-conquer strategy .Describe
binary search in detail and provide time complexity analysis with an example
4. Explain Defective chess board Problem with example?
5. Design the algorithm to find the minimum and maximum element of given array and
derive its time complexity.
6. Explain the Knapsack problem. Find an optimal solution to the Knapsack instance
n=7, m=15, (p1, p2, p3, …p7)=(10,5,15,7,6,18,3) and (w1, w2, w3, …w7)=(2, 3, 5,7, 1, 4,
1).
7. Construct the minimum cost spanning tree using Krushkal algorithm for the given
graph and explain the algorithm.

8. Write Prim’s algorithm to generate minimum cost spanning tree for the given
Graph

9. Develop the control abstraction and derive the time expression for the divide and conquer
logic.
10. Develop the quick sort algorithm and trace it for an example.
11. Explain single source shortest path Problem with example.
12. Explain the method of vertex splitting with an example.

Unit-3

1. Explain the solution to the travelling salesperson problem with a dynamic


programming approach.
2. Formulate the cost function for finding the shortest path in the k-stage graph problem in
dynamic programming.
3. Design the algorithm to find the shortest path in the multistage graph using forworrd
approach.

4. Define optimal binary search tree with example


5. Develop the algorithm for the 0/1 knapsack problem using a dynamic programming
approach with example
6. Write and explain an algorithm to compute the all pairs shortest path using dynamic
programming and prove that it is optimal. Compute the shortest path for the following
graph

7. Illustrate the reliable system design using a dynamic programming approach in detail.
8. Use the function OBST to compute w(i,j), r(i,j), and c(i,j), 0 ≤ i < j ≤ 4, for the
identifier set (a1, a2, a3, a4) = (do, if, int, while) with p(1 : 4) = (3, 3, 1, 1) and
q(0:4)=(2,3,1,1,1). Using the r(i,j)’s construct the optimal binary search tree
9. Identify the possible binary search trees for the identifier set {do, while, if, else}.
10. Write dynamic programming solution for the traveling sales person problem for the
network with the cost adjacency matrix. Assume node 1 as the home city.

Unit-4
1. Develop an algorithm to solve the problem of the sum of subsets.
With m = 35, run SumOf Sub on the data
(a) w = {5,7,10,12,15,18,20},
(b) w = {20,18,15,12,107,5}
(c) w = {15,7,20,5,18,10,12}.
Are there any differences in the computing times?
2. Let w = {5,7,10,12,15,18,20}and m=35. Find all possible subsets of w that sum
to m. Do this using SumOfSub. Draw the portion of the state space tree that is generated.
3. Develop the algorithm to solve the 8-queen problem with suitable diagrams.
4. Illustrate the 4-Queen problem-solving with suitable diagrams.
5. Explain graph coloring with examples.
6. Develop an algorithm to generate an m-coloring graph.
7. Develop the algorithm for recursive backtracking with an example
8. Develop an algorithm to find all Hamiltonian cycles in graphs.
9. Describe the algorithm for Hamiltonian cycles and Determine the order of magnitude
of the worst-case computing time for the backtracking procedure that finds all
Hamiltonian cycles.
10. Compare planar and non-planar graphs with examples.
11. Develop the backtracking solution to the 0/1 Knapsack problem.

Unit-5
1. Develop an algorithm for non-deterministic knapsack.
2. List and explain any two NP-complete problems.
3. Compare the features of deterministic and non-deterministic algorithms with
examples.
4. Develop a non-deterministic algorithm to search for an element in an array.
5. Explain the relation among P, NP, Np-complete and NP-hard problems.
6. Explain the Cook’s theorem.
7. Develop a non-determinsitic clique pseudocode.
8. Using an example prove that, satisfiability of boolean formula in 3-Conjunctive
Normal form is NP-Complete.
9. Is Travelling salesman problem NP-hard or NP-Complete? Justify your answer.
10. Show that the HAMILTONIAN_CYCLE problem on directed graphs is NP complete
11. Explain circuit satisfiability problem with a circuit diagram. Show that circuit
satisfiability problem is NP- hard
12. Illustrate the Node cover decision problem with a neat sketch.

Faculty signature

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