Date: 24-03-2021

Part-A & B Question Bank with Blooms Taxonomy Level (BTL)

Subject Name with code : DAA (18PC0CS08) Class: II Year /II-Sem/CSE

Name of the Faculty Member :Mr. A Ravi Academic Year: 2020-21 (II Semester)

Blooms Taxonomy Levels (BTL)

1. Remembering
2. Understanding
3. Applying
4. Analyzing
5. Evaluating
6. Creating

Sl. Questions Marks BTL Course

No (Part-A) level Outcome
.
UNIT-1
1. Describe the time complexity. 2M L2 CO1
2. If f(n) = 5n2+3n+2 then prove that f(n) is O(n2) 2M L2 CO1
3. Describe the space complexity. 2M L1 CO1
4. Write recurrence equation for merge sort using substitute method 2M L1 CO1
5. List out the reasons for the difficulties that one faces while determining 2M L2 CO1
the lower bound
6. Write the non-recursive algorithm for finding the Fibonacci sequence 2M L2 CO1
and define its time complexity.
7. Trace the time complexity quick sort algorithm 2M L2 CO1
8. Solve the following recurrence: T(n) = 4T(n/2) + n where n >=1 and is 2M L2 CO1
a power of 2
9. How merge sort is related to Divide and Conquer? Explain. 2M L1 CO1
10. What are the methods to calculate time complexities? 2M L2 CO1
UNIT-2
11. Define Greedy method. 2M L2 CO2
12. Write an algorithm for greedy knapsack. 2M L3 CO2
13. Write an Algorithm for n-Queen’s problem 2M L1 CO2
14. What is Minimum spanning tree. 2M L2 CO2
15. What is Reliability Design? 2M L2 CO2
16. Write about UNION and FIND operation with examples. 2M L2 CO2
17. Differentiate between BFS and DFS 2M L1 CO2
18. Write a non recursive algorithm of post order tree traversal 2M L1 CO2
19. Explain the graph traversal with an example 2M L1 CO2
20. Write an algorithm for AND/OR Graphs. 2M L1 CO2
UNIT- 3
21. State the principle of optimality. 2M L3 CO3
22. What is Matrix Chain Multiplication problem? 2M L3 CO3
23. What is 0/1 Knapsack Problem? 2M L1 CO3
24. What is Travelling sales man problem? 2M L1 CO3
25. What is All pair shortest path problem? 2M L2 CO3
26. What are the applications of Greedy method? 2M L1 CO3
27. Describe Knap sack problem. 2M L1 CO3
28. Write about 0/1 Knap sack problem. 2M L1 CO3
29. Write the General method dynamic programming. 2M L1 CO3
30. Write about Reliability design. 2M L2 CO3
UNIT-4
31. List the applications of Backtracking. 2M L2 CO4
32. Define a spanning tree and minimum spanning tree. 2M L2 CO4
33. Write an algorithm for simple union 2M L1 CO4
34. What are the applications of game tree? 2M L1 CO4
35. Define articulation point. 2M L1 CO4
36. Write the General method for Back tracking. 2M L1 CO4
37. Write about Graph coloring problem. 2M L2 CO4
38. What are the applications of branch and bound method? 2M L2 CO4
39. Describe FIFO branch and bound solutions. 2M L2 CO4
40. Describe FIFO branch and bound solutions. 2M L2 CO4
UNIT-5
41. Define State space tree. 2M L2 CO5
42. Define Class P and Class NP 2M L1 CO5
43. Distinguish between deterministic and non deterministic algorithms? 2M L1 CO5
44. Write the control abstraction algorithm for LC search. 2M L1 CO5
45. What is the relation between NP –complete and NP –Hard 2M L2 CO5
46. What are the properties of NP-hard problems? 2M L1 CO5
47. What about Hamiltonian Cycle? 2M L2 CO5
48. What are the properties of NP-Complete problems? 2M L2 CO5
49. What are differences between NP-hard and NP-complete problems? 2M L2 CO5
50. Give the relationship between NP-hard and NP Complete. 2M L2 CO5
Sl. Questions Mark BTL Course
No. (Part-B) s level Outcome
UNIT-1
1. What is algorithm? Explain the properties of algorithm? 5M L1 CO1
2. What is performance Analysis? How we do performance Analysis? 5M L2 CO1
3. Write about Asymptotic Notations?
4. Find time complexity of matrix multiplication of order NxN using both 5M L3 CO1
the methods of time complexity?
5. Write a pseudo code for binary search and analyze the time complexity 5M L3 CO1
6. Write about amortized and probabilistic analysis and also differentiate 5M L4 CO1
between average case analysis , probabilistic and amortized analysis.
7. Describe the Master’s theorem. Solve the following recurrence relations 5M L4 CO1
by using Master’s theorem
T(n) = 4T(n/2) + n ii) T(n) = 2T(n/2) + n log n
8. Define recurrence equation? Find the time complexity of merge sort 5M L4 CO1
from recurrence relation using substitution method.
9. Write a pseudo code that input of n integers and output them in non 10M L5 CO1
decreasing order
10. Define recurrence equation for merge sort using substitute method 10M L5 CO1
UNIT-2
1. Given control algorithm for divide & conquer, then give binary search 5M L1 CO2
algorithm as an example?
2. Write algorithms for merge sort and its complexity? 5M L3 CO2
3. Explain Quick sort and its Algorithms? Explain about general method 5M L3
of Greedy Method?
4. Explain about Greedy Knapsack Problem? 5M L3 CO2
5. Explain about Job Sequencing with deadlines? 5M L4 CO2
6. Explain about Prime’s and kruskal’s algorithm to find minimum 5M L4 CO2
spanning tree?
7. Compute the time complexity of deriving minimum spanning tree from 5M L5
the weigthted connected graph using kruskal’s algorithm?
8. What is a graph? Explain algorithms of spanning trees? 10M L5 CO2
9. Explain strassions Matrix multiplication? 10M L6 CO2
10. Discuss about fractional knapsack problem. Consider the following 10M L6 CO2
instance of knapsack problem n=3,m=20, profits
(p1,p2,p3)=(25,24,15) and weights(w1,w2,w3)=(18,15,10) Obtain the
optimal solution using greedy approach.
UNIT- 3
1. Explain about Dynamic Programming? 5M L1 CO3
2. Give the differences of Greedy and Dynamic Programming? 5M L2 CO3
3. List out the Dynamic programming applications 5M L3 CO3
4. Explain about matrix chain multiplication method? 5M L3 CO3
5. Explain about Optimal Binary Search Tree? 5M L4 CO3
6. Explain the Travelling sales person problem with an example 5M L4 CO3
7. Explain the All pairs shortest path problem. 5M L4 CO3
8. Explain 0/1 knapsack problem and Explain the approach to solve it using 5M L5 CO3
dynamic programming? Explain with an example?
9. What do you mean by forward and backward approach of problem solving in 5M L5 CO3
dynamic programming?
10. Develop an algorithm for matrix chain multiplication and explain how to 10M L6 CO3
determine the sequence of multiplication that will take less number of scalar
multiplication for the given matrices with their orders A5x13 B13x8 C8x10
D10x5
UNIT-4
1. Describe Branch and Bound 0/1 knapsack problem using LC method 5M L1 CO4
2. Describe FIFO branch and bound solutions. 5M L2 CO4
3. Describe FIFO branch and bound solutions. 5M L2 CO4
4. Explain about backtracking? 5M L3 CO4
5. Explain about sum of subsets problem using backtracking? 5M L3 CO4
6. Explain algorithm of m-colored graph with an Example? 5M L3 CO4
7. Write an algorithm of Prim’s minimum cost spanning tree. 5M L4 CO4
8. What are the applications of branch and bound method? 5M L4 CO4
9. Write the pseudo code for dijkshra’s algorithm for single source shortest path 10M L5 CO4
problem
10. What is graph coloring problem? Describe the back tracking technique to m- 10M L5 CO4
coloring with a planar graph example.
UNIT-5
1. Describe Non-deterministic algorithm? 5M L1 CO5
2. Explain properties of NP-complete and NP-Hard problems? 5M L2 CO5
3. Explain about Tractable and Intractable Problems 5M L2 CO5
4. Explain the differences between decision and optimization problems? 5M L2 CO5
5. Write short notes on 3-SAT problem 5M L3 CO5
6. Explain about Approximation algorithms 5M L3 CO5
7. Explain about Randomized algorithms. 5M L3 CO5
8. Explain the classes of NP-hard and NP – complete 10M L4 CO5
9. State the Cook’s theorem. What is the significance of this theorem? 10M L5 CO5
10. Prove the CNF satisfiabilty of AND/OR graph decision problem 10M L5 CO5