Title DAA.docx ✅

1 Q.No Questions Bloom’s taxonomy levels CO 1. Write the general plan for divide and conquer algorithms. Write any four example of divide and conquer. RE 2 2. Write the algorithm of Quick Sort and analyze it. UN 2 3. Find the minimum spanning tree using Kruskal algorithm for the following graph. AP 2 4. Solve the Knapsack problem using Greedy algorithm for the following data. Item A B C D Profit 280 100 120 120 Weight 40 10 20 24Where W=60 EV 2 5. Analyze the merge sort algorithm .Argue on its best case and worst case. AN 2 6. Write an prim”s algorithm to Find the minimum spanning tree using Prim’s algorithm for the following graph. AP 2 7. Generate the concept of Dijkstra algorithm and print the Sequence of extracted node for the given graph CR 2