Scribd
Upload
16 views

Dynamic Programming DSA

This document discusses several dynamic programming problems including Fibonacci numbers, coin change, rod cutting, knapsack, subset sum, and longest common subsequence. For each problem, it provides pseudocode for naive recursive and dynamic programming solutions. It also discusses ways to optimize the solutions and print additional output like the coins/items used.

Uploaded by

nurulalomador
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Dynamic Programming DSA

This document discusses several dynamic programming problems including Fibonacci numbers, coin change, rod cutting, knapsack, subset sum, and longest common subsequence. For each problem, it provides pseudocode for naive recursive and dynamic programming solutions. It also discusses ways to optimize the solutions and print additional output like the coins/items used.

Uploaded by

nurulalomador
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Dynamic Programming

Practice problems:

PROBLEM 01. Fibonacci number

Pseudocode (Naive Recursion):


Function Fib(n): Time complexity: O(2^n)
1. if n==0 or n==1 then Space complexity: O(1)
2. return n
3. end if
4. return Fib(n-1) + Fib(n-2)

DP Pseudocode (Memoization/Top-down):
Create array F[0…n] = NIL Time complexity: O(n)
F[0]=0, F[1] = 1
Space complexity: O(n)
Function Fib(n):
1. if n==0 or n==1 then

2. return n

3. end if

4. if F[n-1] = NIL then

5. F[n-1] = Fib(n-1)

6. end if

7. if F[n-2] = NIL then

8. F[n-2] = Fib(n-2)

9. end if

10. return F[n-1]+F[n-2]

DP Pseudocode (Tabulation/Bottom-up):
Function Fib(n): Time complexity: O(n)
1. Create array F[0…n]
2. F[0]=0, F[1] = 1 Space complexity: O(n)

3. for i = 2 to n do

4. F[i] = F[i-1]+F[i-2]

5. end for
6. return F[n]
DP Pseudocode (Problem-specific optimization):
Function Fib(n): Time complexity: O(n)
1. f0=0, f1=1
2. for i = 2 to n do Space complexity: O(1)
3. f2 = f0+f1
4. f0 = f1
5. f1 = f2
6. end for
7. return f1
PROBLEM 02. Coin change problem
Consider the problem of making change for M cents using the fewest number of coins. There are d
types of coins C = {c1, c2, …, cd}, each coin’s value is an integer and there are an infinite number of
coins for each coin type. Write a greedy algorithm to make change consisting of coins in C.

Pseudocode (Naive Recursion):


Function Recursive-Change (M, C, d):

1. if M = 0 then

2. return 0

3. end if

4. mnc = infinity // minimum number of coins

5. for i = 1 to d do

6. if C[i] <= M then

7. nc = Recursive-Change(M-C[i], C, d)

8. if nc+1 < mnc then

9. mnc = nc+1

10. end if

11. end if

12. end for

13. return mnc

Pseudocode (Tabulation method):


Function Coin-Change (M, C, d):
1. create an array mnc[0…M]
2. mnc[0] = 0
3. for m = 1 to M do
4. mnc[m] = infinity
5. for i=1 to d do
6. if C[i] <= m and mnc[m-C[i]]+1 < mnc[m] then
7. mnc[m] = mnc[m-C[i]]+1
8. end if
9. end for
10. end for
11. return mnc[M]

Food for thought:


How to print the coins taken?

Alternative Problem 2.2


Consider the problem of making a M meter long rope using smaller ropes. There are d types of ropes
C = {c1, c2, …, cd}, each rope’s value is an integer and there are an infinite number of ropes for
each rope type. Joining two ropes together costs X dollar. Write an algorithm to make the M meter
long rope with minimum costs.
PROBLEM 03. Rod cutting

Pseudocode (Naive recursion):

Pseudocode (Tabulation method):


Pseudocode (Tabulation method):

Function Coin-Change (p, n):


12. create an array r[0…n]
13. r[0] = 0
14. for rodlen = 1 to n do
15. r[rodlen] = - ∞
16. for cutlen = 1 to rodlen do
17. if p[cutlen]+r[rodlen-cutlen] > r[rodlen] then
18. r[rodlen] = p[cutlen]+r[rodlen-cutlen]
19. end if
20. end for
21. end for
22. return r[n]

Food for thought:


How to print the rod cuts?
PROBLEM 04. 0-1 Knapsack
The weights and values of n items are given. The items are not divisible, i.e., you cannot take a
fraction of an item. You have a knapsack to carry those items, whose weight capacity is W. Due to
the capacity limit of the knapsack, it might not be possible to carry all the items at once. In that case,
pick items such that the profit (total values of the taken items) is maximized.

Write a program that takes the weights and values of n items, and the capacity W of the knapsack
from the user and then finds the items which would maximize the profit using a dynamic
programming algorithm.

sample input sample output


n
weight, value
…
W

4
item 1: 4.0 kg 20.0 taka
4 20
item 4: 1.0 kg 7.0 taka
3 9
profit: 27 taka
2 12
1 7
5

Pseudocode (Tabulation method):


Function Knapsack( v[], w[], W):

Time complexity: O(nW)


Space complexity: O(nW)
Food for thought:
How to print the items taken?
PROBLEM 05. Subset sum problem
You are given an array A and a number N. You need to find out if N is a sum of any subset of A or
not.

Example:

A = {2, 4, 5, 6, 8}, N = 15 🡪 True {4, 5, 6}

A = {2, 4, 5, 6, 8}, N = 0 🡪 True {}

A = {2, 4, 5, 6, 8}, N = 3 🡪 False

Hint: similar to 0-1 knapsack. Think of A as a set of items, N as knapsack capacity.

Food for thought:


How to print the numbers taken?

PROBLEM 06. Longest common subsequence

Given two strings x and y, find the longest common subsequence and its length.

Example:

x = “ABCBDAB”

y = “BDCABA”

longest common subsequence = “BCBA”

longest common subsequence length = 4

x = “ABBACQ”

y = “XAYZMBNNALQCTRQ”

longest common subsequence = “ABACQ”

longest common subsequence length = 5

Hint: CLRS 15.4

You might also like