class_3_dynamic_programming(5).pdf

# class_3_dynamic_programming(5).pdf - Dynamic programming...

• Notes
• 81

This preview shows pages 1–7. Sign up to view the full content.

Dynamic programming Dynamic programming A few words about Dynamic programming Longest common subsequence The 0-1 Knapsack problem Dijkstra’s algorithm Dynamic programming August 16, 2017

This preview has intentionally blurred sections. Sign up to view the full version.

Dynamic programming Dynamic programming A few words about Dynamic programming Longest common subsequence The 0-1 Knapsack problem Dijkstra’s algorithm Overview 1 Dynamic programming A few words about Dynamic programming Longest common subsequence The 0-1 Knapsack problem Dijkstra’s algorithm
Dynamic programming Dynamic programming A few words about Dynamic programming Longest common subsequence The 0-1 Knapsack problem Dijkstra’s algorithm Dynamic programming Like the divide and conquer approach, dynamic programming also breaks a problem into subproblems, solves the subproblems, and than combine the solutions. Unlike divide and conquer, the subproblems in dynamic programming are not disjoint - they overlap. A dynamic programming algorithm, solves each subproblem and saves the solution in a table. This makes it possible to avoid recalculating the common parts over and over again. Dynamic programming approach is often suitable for optimization problems. These are problems where we look for an optimal (minimal or maximal) solution among many possible solutions.

This preview has intentionally blurred sections. Sign up to view the full version.

Dynamic programming Dynamic programming A few words about Dynamic programming Longest common subsequence The 0-1 Knapsack problem Dijkstra’s algorithm Dynamic programming Like the divide and conquer approach, dynamic programming also breaks a problem into subproblems, solves the subproblems, and than combine the solutions. Unlike divide and conquer, the subproblems in dynamic programming are not disjoint - they overlap. A dynamic programming algorithm, solves each subproblem and saves the solution in a table. This makes it possible to avoid recalculating the common parts over and over again. Dynamic programming approach is often suitable for optimization problems. These are problems where we look for an optimal (minimal or maximal) solution among many possible solutions.
Dynamic programming Dynamic programming A few words about Dynamic programming Longest common subsequence The 0-1 Knapsack problem Dijkstra’s algorithm Dynamic programming Like the divide and conquer approach, dynamic programming also breaks a problem into subproblems, solves the subproblems, and than combine the solutions. Unlike divide and conquer, the subproblems in dynamic programming are not disjoint - they overlap. A dynamic programming algorithm, solves each subproblem and saves the solution in a table. This makes it possible to avoid recalculating the common parts over and over again. Dynamic programming approach is often suitable for optimization problems. These are problems where we look for an optimal (minimal or maximal) solution among many possible solutions.

This preview has intentionally blurred sections. Sign up to view the full version.

Dynamic programming Dynamic programming A few words about Dynamic programming Longest common subsequence The 0-1 Knapsack problem Dijkstra’s algorithm Dynamic programming
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern