[go: up one dir, main page]
Scribd
Upload
2 views3 pages

Assign 4

The document discusses Dynamic Programming (DP) as an efficient method for solving problems by breaking them down into simpler, overlapping subproblems. Key characteristics of DP include optimal substructure, overlapping subproblems, memoization/tabulation, and enhanced efficiency. The approach is versatile and applicable to various optimization and algorithmic challenges.

Uploaded by

me.manavgoel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views3 pages

Assign 4

The document discusses Dynamic Programming (DP) as an efficient method for solving problems by breaking them down into simpler, overlapping subproblems. Key characteristics of DP include optimal substructure, overlapping subproblems, memoization/tabulation, and enhanced efficiency. The approach is versatile and applicable to various optimization and algorithmic challenges.

Uploaded by

me.manavgoel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Manav Goel

01816403223
Btech CSE 4th sem

Assignment 4

Recursive Solution

OUTPUT
Manav Goel
01816403223
Btech CSE 4th sem

Memoised Solution

OUTPUT
Manav Goel
01816403223
Btech CSE 4th sem

DYNAMIC PROGRAMMING:

Dynamic Programming (DP) is an efficient method of solving


problems optimally by reducing complex problems to simpler,
overlapping subproblems. The main characteristics are:
1. Optimal Substructure: Optimal solution of a problem can be
formed using optimal solutions of its subproblems.
2. Overlapping Subproblems: Subproblems are solved several times.
3. Memoization/Tabulation: Subproblem solutions are saved in order
to not solve them again (either top-down through memoization or
bottom-up through tabulation).
4. Efficiency: DP minimizes time complexity because it solves a
subproblem once.
5. Versatility: Generalizable to optimization, combinatorial, and
algorithmic problems in many areas.
DP's major strength is to exchange space (for the purpose of holding
solutions) with time, considerably enhancing efficiency.

You might also like