Course Content

Other Courses

Tribhuvan university > CSIT - 2074 Syllabus > Design and Analysis of Algorithms > Old Questions > 2078(New Course)

Design and Analysis of Algorithms - Old Questions

Syllabus Notes Old Questions Unit Wise Questions Question Bank

3. Explain in brief about the Dynamic Programming Approach for algorithm design. How it differs with recursion? Explain the algorithm for solving the 0/1 knapsack problem using the dynamic programming approach and explain its complexity. (2+2+6)

10 marks | Asked in 2078(New Course)