DAA Theory questions: LAC Write difterent types of a nplotic notations of the algorithm 4&3 What is recurrence relation? 5G State masters theorem, Vv What is recursive tree? Wy recursive tree nethod is better than the substitution method of solving the recurrence relation? What is little 0 and little omega? AF Detine the difference between recursion and iteration. What do you mean by greedy method? {9 What do you mean by dynamic programming? GE, What do you mean by Divide and conquer strategy? Differentiate between divide-and-cong State the 0\1 knapsack problem, . Define Brute-force algorithm, Difference between Backtracking and Branch-and-Bound, Discuss Job-sequencing problem. Discuss the difference between di State the general knapsack probl What is Heap property? Write the difference between DES and BFS, + Write the difference between Prim’s and Kruskal’s algorithm, Explain.the max-flow min-cut theorem with example. . Write sort notes ” ! Dijkstra’s algorithm 1 Kruskal’s algorithm quer and dynamic programming. #12, lynamic programming and greedy met! em, 11] Minimum spanning tree. Ford-Fulkerson algorithm * B queens problem Vii Bellman-ford algorithm Vii, Heuristic algorithm TX Union find algorithm |Algorithm based questions: 1. Write down the algorithm of Quick sort and find the time-complexity 2. Write down the algorithny of Merge sort and find the time-complexity Write the algorithm of mately chain multiplication 8. Write down the al orithny of 8:Queen problem and find the time-complexity’ 2 Write Bellman-Ford’s algorithm and find the time-complexity, 6 Bind the worst and best case time-complexity of Binary search algorithm | 7. Write down the algorithm of Graph Coloring and find the time-complexity LE Write down the algorithm of Job-sequencing problem "Write down thy algorithm of Knapsack problem. 10. Describe the backtracking algorithm to find the Hamiltonian cycle in < Hamiltonian cycle. 11. Write the algorithm of heap sort. AZ Write Kruskal’: Igorithm and find the time-complexity. ~S. Write Prim’s algorithm and find the time-complexity. <¢ Write Dijkstra’s algorithm and find the time-complexity. 25. Write Floyd's algorithm and find the time-complexity.DAA problems: 1, Solve the recurrence relations: ME T(n) = 20(n/2) 4 UE Tin) = Ted) + logn WH Tn) = 27 (n/a) + Vn We Tin) = 27 (\n) + logn YO Tin) = T2n/3) +1 Yr Ta) (n/2) + 5n Tin) = 27 (n/4) +n 0 T(n) = V2 T(n/2) + logn J Find the minimum spanning tree using prim’s algorithm: JN PIN | i "Na |" De aa 4 ; Gy5, Knapsack problem: “ttems | oh | hk bh yh Weight "5 [1015 3-4 Cost 30 40 et = 3 5 | 77 oo ij ‘a's [ rahe grants ain’ pijkstra vind hy algoritha e shortest pall! 36, 45, 55) and the profit vector pacity 100, find at least for the Given weight vector (15, 25, (10, 20, 30, 40, 50) and a ina’ psack of cay three feasible solutions including optimal one knapsack problem of 5 times “Given weight vector (2, 3, 3, 7,1, 4, 1) and the profit vector (10, 5, 15,7, 6, 188yind a knapsack of capacity 15, find at least three feasible solutions including optimal one for™ the knapsack problem of 7 objects. gC Solve the following, knapsack problem with the given conditions: n =3 weight of the knapsack M = 20, profits (pl, p2, p3) = (25, 24,15) and weight (w1, w2, w3) = (18, 15, 10). J. Consider the following table that consist of some items with weight and cost valutthe knapsack capacity W = 60 kg, find the aptimal solution using greedy crite For the given set of 5 items and the knapsack capacity of 10ky, find the maximum profit. 3,2.5,1) 10,12, 8} ng problem: Using greedy strategy, schedule the following jobs within Geaciline so as to maximize the profit, Deadlines and profits re mentioned as follow: = Job | Deadlines rofit | 7 rofit_| 9 | 2 If we have for t Se 2 ask T1, T2, T3, Ta having deadline D1 = 2, D2 =1,D3= 2, D4 = 1 and profit Pl = 100, P2 = 10, P3 = 27, Pa = 15, find the maximum profit. 7. Huffman coding: © Consider the following message: aabbbbabbbeccdddeeececeeedd, Find the number of bits required for Huffman coding also find the average bits required to represent a character, 8. Matrix chain multiplication: 7. Find the minimum number of operations required for the following matrix chain multiplication using dynamic programming: A(10 20) * B(20 x 50) * C(50.x 1) * DL x 100), AT Find the optimal parenthesization of a matriy whose sequence of dimensions is <5, 10, 3, 12, 5, 50, and 6> chain product \ | | |Find out the maximum flow: sink: 5 20 4 Create the Max-heap containin; 9, 20, 30, 40, 50, 60, 70, 80, 90, 100 10. ig the following elements: 10, Solve the APSP problem using Floyd-warshall’s algorithm: 42 Applying the backtracking technique to solve the graph coloring: colo = EB, ay RF