SRI INDU COLLEGE OF ENGG & TECH

QUESTION BANK (Regulation:R20)

(Regulation :R20)
Department of Computer Science and Engineering

Sub. Code & Title R20CSE3203 Design and Analysis of Algorithms

Academic Year: 2023-24 Year/Sem./Section III - II/A, B,C,D
Faculty Name & Designation B.Navya, Assistant Professor
E.Pavithra , Assistant
Professor
QUESTION BANK WITH BLOOMS TAXONOMY LEVEL (BTL)
(1. Remembering 2. Understanding 3. Applying 4. Analyzing 5. Evaluating 6.
Creating)

UNIT I
PART- A
1 MARK QUESTIONS BT COURSE
LEVEL OUTCOME
1. Define an algorithm. 1 CO1
2. List out the properties of the algorithm? 1 CO1

3. What is Space Complexity and Time Complexity? 1 CO1

4. What is Pseudo code? 1 CO1
5. List the asymptotic notations?
1 CO1
6. Define Divide and Conquer.
1 CO2
7. What is binary search?
1 CO2
8. What is sorting?
1 CO2
9. What are the applications of divide and conquer.
1 CO2
10. Define Stassen’s matrix multiplication.
1 CO2
11. Define Probabilistic analysis?
1 CO2
12. Write the time complexity of merge sort and Quicksort?
1 CO1
PART-B
10 MARKS QUESTIONS
1. What do you mean by performance analysis of an algorithm? Explain 2 CO1
2. Define algorithm. Explain the characteristics of the algorithm 1 CO1
3. Explain in detail about Big-oh notation and Little-oh notation. 5 CO1
4. What is meant by time complexity? Define different time complexity notations. Give 1
examples one for each.? CO1
5. Explain in detail about probabilistic analysis and amortized analysis. 5 CO1
6. Explain Binary search algorithm with an example.? 2 CO2
7. Develop general method for Divide and Conquer approach? 3
CO2
8. Explain Merge sort algorithm using divide and conquer method. 2 CO2
9. Explain Stassen’s Matrix multiplication with example. 2 CO2
10. To construct how quick sort sorts the following sequences of keys in ascending order. 6 CO2
22, 55, 33, 11, 99, 77, 44, 66, 54, 21, 32.
11. Write the steps for Pseudo-Code for writing Algorithms 2 CO2
12. What is Divide and Conquer techniques? Using this technique. Write an algorithm of 1 CO1
Quick sort then analyze it?
 SRI INDU COLLEGE OF ENGG & TECH
QUESTION BANK (Regulation :R20)
(Regulation :R20)
Department of Computer Science and Engineering
Sub. Code & Title R20CSE3203 Design and Analysis of Algorithms
Academic Year: 2023-24 Year/Sem./Section III-II/A,B,C,D
Faculty Name & Designation B.Navya, Assistant Professor
E.Pavithra , Assistant
Professor

UNIT II
PART- A
1 MARK QUESTIONS BT COURSE
LEVEL OUTCOME
1 Define Disjoint set.( remembering) 1 CO3
2. What is weighting rule for Union.( remembering) 1 CO3
3. What are the types of graph traversal?( remembering) 1 CO3
4. What are the different Tree traversals.(understanding) 2 CO3
5. Write algorithm for simple Union & find Operations.( remembering) 1 CO3
6. Define Graph.( remembering) 1 CO3
7. Define Connected component(remembering) 1 CO3
8. Define Bi-connected components.( remembering) 1 CO3
9. What is Adjacency Matrix?( remembering) 1 CO3
10. Define Spanning Tree.( remembering)
1 CO3
11. What is Collapsing Rule?
2 CO2
12. What is AND / OR graph.
3 CO2
PART- B
10 MARKS
QUESTIONS
1. Explain the usefulness of the following fundamental operations on sets: 2 CO3
(a) FIND (b) UNION
2. Explain briefly in detail about non-recursive binary tree traversal algorithm with 5 CO3
example.
3. Differentiate between BFS and DFS. 4 CO3
4. Explain the Properties of Depth first search and Breadth first search. 2 CO3

5. Write about AND / OR Graphs . 2 CO3

6. Write about Disjoin set union and Find(i) s1={1, 7, 8, 9} s2={2, 5, 10} s3={3, 4, 6} 2 CO3
7. Explain briefly about Bi-connected components with example. 2 CO3
8. Explain in detail about Spanning trees with your own example. 2 CO3
9. Write and explain the UNION algorithm using Weighted rule with an example 1 CO3
10. Explain briefly in detail about recursive binary tree traversal algorithm with example. 2 CO3
11. Explain Kruskal’s algorithm and give any example .& Prims algorithm and give any 2 CO3
example.
12. Write and explain the find algorithm using collapse rule with an example. 2 CO3
 UNIT-III
PART-A
1 MARK QUESTIONS BT COURSE
LEVEL OUTCOME
1. Give two real time problems that could be solved using greedy algorithm. 5 CO4
2. Define greedy method. 1 CO4
3. What is minimum cost spanning tree? 1 CO4
4. What is job sequencing? 1 CO4
5. Define knapsack problem. 1 CO4
6. Define single source shortest path. 1 CO4
7. What is dynamic programming? 1 CO4
8. Write general method of dynamic programming. 1 CO4
9. What is optimal binary search tree? 1 CO4
10. What is travelling sales man problem.
1 CO4
11. What is Reliability Design
1 CO4
12. Define principle of optimality?
2 CO4
PART-B
10 MARKS
1. Write about Job sequencing with deadlines and 0/1 knapsack problem. 2 CO4
2. Explain single source shortest path of Dijkstra’s algorithm with example. 2 CO4
3. 2 CO4
Explain Kruskal’s algorithm with an example.
4. 2 CO4
Explain Prim’s algorithm with an example.
5. Explain minimum cost spanning tree. 2 CO4

6. Explain about single source shortest path algorithm with an example 2 CO4
7. 4 CO4
Compare Divide and Conquer approach and greedy method
8. Solve the following problem of Job sequencing with the dead line specified using 5 CO4
Greedy strategy: N=4, (p1, p2, p3, p4)=(100,10,15,27) (d1, d2, d3, d4)=
(2,1,2,1).
9. Find the optimal solution for the given instance of knapsack 5 CO4
problem .n=3,knapsack capacity m=20,
weight=(18,15,10),profits=(25,24,15).
10. Illustrate Reliability Design. 4 CO4
11. Explain with an example of Travelling Salesman Problem. 2 CO4
12. Explain about Matrix Chain Multiplication using Dynamic Programming method? 2 CO4
 SRI INDU COLLEGE OF ENGG & TECH
QUESTION BANK (Regulation :R20)
(Regulation :R20)
Department of Computer Science and Engineering
Sub. Code & Title R20CSE3203 Design and Analysis of Algorithms
Academic Year: 2023-24 Year/Sem./Section III – II /A,B,C,D
Faculty Name & Designation B.Navya, Assistant Professor
E.Pavithra , Assistant
Professor

UNIT-IV
PART-A
1 MARK QUESTIONS BT COURSE
LEVEL OUTCOME
1. Define Backtracking . 1 CO5
2. What do you mean by State Space Tree? 1 CO5
3. Define n-Queens Problem. 1 CO5
4. What is Hamiltonian cycle ? 1 CO5
5. Define the term Branch and Bound Technique . 1 CO5
6. Differentiate Feasible Solution and optimal solution . 4 CO5
7. What is LIFO Search? 1 CO5
8. What is FIFO Search? 1 CO5
9. Define the following terms live node and E-node. 1 CO5
10. List the properties of LC-Search. 1 CO5

11. What is Sum of Subset problem. 1 CO5

12. What is Graph Coloring. 1 CO5

PART-B
10 MARKS
1. What is Backtracking? Explain in detail. 2 CO5
2. Explain Subset-sum Problem & Discuss the possible solution strategies using 2 CO5
backtracking.
3. Write short notes on (a) Graph coloring (b) 8-Queens problem 2 CO5
4. Explain n-Queens problem with an algorithm. 2 CO5
5. Apply Backtracking technique to solve the following instance of the sum of sub sets 3 CO5
problems w={5,7,10,12,15,18,20} & m=35
6. Explain graph coloring algorithm with an example 2 CO5
7. Explain Hamiltonian cycle with an example. 2 CO5
8. Using Backtracking enumerate how can you solve the following problems 6 CO5
(a) 8-Queens problem
(b) Hamiltonian Cycle problem
9. Find out solution for knapsack problem using LC and FIFO Branch and Bound 5 CO5
 SRI INDU COLLEGE OF ENGG & TECH
QUESTION BANK (Regulation :R20)
(Regulation :R20)
Department of Computer Science and Engineering
Sub. Code & Title R20CSE3203 Design and Analysis of Algorithms
Academic Year: 2023-24 Year/Sem./Section III – II /A,B,C,D
Faculty Name & Designation B.Navya, Assistant Professor
E.Pavithra , Assistant
Professor
10. 4 CO5
Compare Backtracking and Branch and Bound method.
11. 2 CO5
Explain with an example how branch and bound technique is used to solve
knapsack problem.
12. 2 CO5
Explain General method of Branch and Bound.
 SRI INDU COLLEGE OF ENGG & TECH
QUESTION BANK (Regulation :R20)
(Regulation :R20)
Department of Computer Science and Engineering
Sub. Code & Title R20CSE3203 Design and Analysis of Algorithms
Academic Year: 2023-24 Year/Sem./Section III – II /A,B,C,D
Faculty Name & Designation B.Navya, Assistant Professor
E.Pavithra , Assistant
Professor

UNIT-V
PART-A
1 MARK QUESTIONS BT COURSE
LEVEL OUTCOME
1. Define polynomial.
1 CO6
2. Define NP. 1 CO6
3. What is NP-hard problem?
1 CO6
4. What is NP-complete problem? 1 CO6
5. What is halting problem?
1 CO6
6. Define Cook’s theorem. 2 CO6
7. What is Deterministic algorithm? 1 CO6
8. What is Decision Problem? 1 CO6
9. Compare P and NP. 4 CO6
10. Differentiate between NP-Complete and NP-Hard. 4 CO6
11. Explain the P, NP, NP-Hard and NP- complete classes. 2 CO6
12. What is non deterministic algorithm explain. 1 CO6
PART-B
10 MARKS
1. Explain NP-hard and NP-Complete Classes. 2 CO6
2. Distinguish between Deterministic and non-deterministic algorithm. 4 CO6
3. What is meant by Halting problem explain with an example
1 CO6
4. Differentiate between NP-Complete and NP-Hard.
4 CO6
5. Explain Optimization problem.
2 CO6
6. Briefly explain the concepts of the NP-Hard and NP-Complete?
2 CO6
7. Explain the P, NP, NP-Hard and NP- complete classes? Give relationship between them?
2 CO6
8. State and explain Cook’s Theorem 2 CO6
9. Explain different types of NP problems.
2 CO6
10. a. How are P and NP problems related?
4 CO6
b. Differentiate Time Efficiency and Space Efficiency.
11. Explain the strategy to prove that a problem is NP-hard?
2 CO6
12. a. Write and explain the Cooks theorem.
3 CO6
b. What is non deterministic algorithm explain.