DAA Unit 4: Advanced Design and Analysis Previous Year Questions
Write a note on Dynamic programming. Write a difference between Dynamic programming and Greedy approach. Write the elements of Dynamic programming. Explain Matrix-chain multiplication problem and solve it by using Dynamic Programming with one example. Explain Longest Common Subsequence. Write its pseudo code for computing the length of LCS. Explain knapsack problem. Write its Greedy … Read more