Module 7: Dynamic Programming

Welcome to Module 7

When a divide-and-conquer strategy is applied to \an algorithm with overlapping subproblems, it may inefficient compute certain subproblems multiple times. Dynamic programming is a technique by which precomputed subproblems are stored to avoid the expense of recomputing them.

Module Learning Outcomes

Upon successful completion of this module, you will be able to:

  1. Store precomputing subproblems to increase algorithm efficiency (CLO 4).

(CLO = Course Learning Outcome)

To Do

Please read/watch all of the module learning materials (readings, presentations, videos, etc.) and complete all assignments/assessments listed below. If you have questions, please contact the course instructor or ask in the Questions About This Course forum.

Readings and Presentations:

  • Read Section 14.1: Introduction to Dynamic Programming

Assignments/Assessments:

  • Practice by implementing rod-cutting algorithm in C++

Click the Next ▶ button to continue.