Scribd
Upload
5 views

Design and Analysis of Algorithms (21CS2009)_Model Question Bank

This document is a model question bank for the Design and Analysis of Algorithms course for the academic year 2023-24. It includes a list of questions categorized by modules, covering various topics such as algorithm definitions, sorting algorithms, greedy methods, graph traversals, and NP-completeness. Each question is associated with specific course outcomes, Bloom's Taxonomy levels, and marks.

Uploaded by

23715a0513
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
5 views

Design and Analysis of Algorithms (21CS2009)_Model Question Bank

This document is a model question bank for the Design and Analysis of Algorithms course for the academic year 2023-24. It includes a list of questions categorized by modules, covering various topics such as algorithm definitions, sorting algorithms, greedy methods, graph traversals, and NP-completeness. Each question is associated with specific course outcomes, Bloom's Taxonomy levels, and marks.

Uploaded by

23715a0513
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/ 3

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

MODEL QUESTION BANK

Class: III Year I Sem Academic Year: 2023-24


Subject: Design and Analysis of Algorithms (21CS2009)
Branch: CSE A, B & C Staff Name: Dr. D. Nagaraju / Dr. C. Rama Mohan

S. No Questions CO BTL Marks

Module-I

1. Define an algorithm and various performance factors of an algorithm 1 1 5


Explain about the Algorithm specifications and all important factors of
2. 1 2 10
an algorithm
Explain about the Divide and Conquer general method and design an
3. 1 2 10
algorithm for binary search, give an example that the worst-case
efficiency
Design an of binary search
algorithm is log n.
for finding maximum and minimum of a list of
4. 1 3 10
elements with an example
Write merge sort algorithm by sorting the list {E, X, A, M, P, L, E} in
5. 1 1 10
the alphabetical order using the merge sort.
Write quick sort algorithm for the following set of numbers: 18, 25, 18,
6. 1 1 10
40, 11, 37, 32, 9 and explain best case, average case and worst cases
Apply Strassen’s algorithm to compute matrix multiplication with
clearly
7. 1 3 10
suitable example.
8. Write Selection sort algorithm with a set of numbers 1 1 10
Explain about the Time Complexity and different types of Order of
9. 1 2 10
Time Complexity with Best Case, Average Case and Worst-case
Scenario
Module -II
1. Using greedy method to find an optimal solution to the knapsack
instance n = 7 objects and the capacity of knapsack m = 15. The profits
and weights of the objects are (P1, P2, P3, P4, P5, P6, and P7) = (10, 2 1 10
5, 15, 7, 6, 18, and 3) (W1, W2, W3, W4, W5, W6, W7) = (2, 3, 5, 7,
1, 4, and 1).
2. Illustrate an optimal solution for the job sequencing problem with
deadlines where n = 4 Profit (p1, p2, p3, p4) = {100, 10, 15, 17} and 2 1 10
deadlines = {2, 1, 2, 1}.
3. Obtain the minimum cost spanning tree for the graph whose weight
matrix is given below.

2 2 10

4. Write an algorithm to find the minimum cost spanning tree using


2 1 10
Kruskal’s method with an example.
5. Write an algorithm to find the minimum cost spanning tree using
2 1 10
Prim’s method with an example.
6. Write an algorithm to find single source shortest paths with an example
2 2 10
by using Dijkstra’s Algorithm.
7. Using dynamic programming, solve the all pairs shortest path problem
with an example by using Floyds Algorithm. 2 1 10

8. Solve the following knapsack problem using dynamic programming


capacity W = 5.

Item 1 2 3 4 2 3 10
Weight 2 1 3 2
Value 12 10 20 15

9. a) Explain about the Greedy Method Approach in detail.


2 3 10
b) Differentiate the Greedy Method and Dynamic Programming.

Module –III
1. Explain tree traversal techniques with suitable examples. 3 1 10
2. Explain graph traversals a) breadth first traversal b) depth first
3 1 10
traversals with an example.
3.
Describe about connected components and spanning trees 3 2 10
4. Describe bi – connected components of a graph with a suitable
3 2 10
example.
5. Draw the state space tree for solving 8 - queens problem using back
3 1 10
tracking.
6. Explain back tracking concept and apply it to solve subset sum
3 1 10
problem for S = {6, 5, 3, 7} and d = 15.
7.
Explain Graph coloring algorithm with an example. 3 1 10
8.
Explain Hamiltonian cycle algorithm with an example. 3 2 10
9.
Draw the general method of backtracking for Knapsack Problem. 3 2 10
10.
Explain about the sum of subsets problem with example clearly. 3 2 10
Module -IV
1. Explain about the general method of Branch and Bound Techniques 4 1 5
2. Define about different types of branches bound in DAA 4 1 10
3. Explain about the FIFO Branch and Bound 4 2 10
4. Explain about the LIFO Branch and Bound 4 1 10
5. Explain about the LC Branch and Bound 4 1 10
6. Explain Lower bound theory with an example 4 1 10
7. Explain about the transitive Closure with the help of Lower Bound
4 2 10
Theory
8. Illustrate a solution for travelling salesman problem, using branch
4 2 10
and bound technique.
9. Develop a State Space Tree for Branch and Bound Theory 4 2 10
10. Explain branch and bound technique is used to solve 0/1 knapsack
4 2 10
problem

Module –V
1. Explain the relationship between P, NP, NP Hard, NP Complete 5 2 10
2. Explain about the NP – completeness and NP hardness and difference
5 2 10
between NP Hard and NP Complete
3. Explain at least three problems that can be classified as NP, NP –
5 2 10
complete and NP – hard problems.
4. Explain NP – complete problems Node Cover problem 5 2 10
5. Explain about the Clique Decision Problem in NP Hard
6. Explain about Cook’s theorem 5 2 10
7. Illustrate chromatic number decision problem is NP – complete. 5 3 10
8. Explain that the Hamilton path problem is NP – complete. 5 2 10
9. Explain about the Reduction problems in NP Hard and NP complete 5 2 10

You might also like