0% found this document useful (0 votes)
126 views3 pages

DP Matrix-Chain Multiplication (MCM) :: Questions

Uploaded by

Pritom Das
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
0% found this document useful (0 votes)
126 views3 pages

DP Matrix-Chain Multiplication (MCM) :: Questions

Uploaded by

Pritom Das
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

DP

Matrix-Chain Multiplication ( MCM ) :


videos basic - https://youtu.be/prx1psByp7U?si=-NbEqlRxCam4H_4G
program - https://youtu.be/eKkXU3uu2zk?si=HoKh12WsAjtQwdXL
articles https://www.geeksforgeeks.org/matrix-chain-multiplication-dp-8/
practice - https://www.javatpoint.com/matrix-chain-multiplication-example

Questions:
1. Find an optimal parenthesizing of a matrix-chain product whose sequence of dimensions
(5, 10, 3, 12, 5, 50, 6) . You have to show the value of both m and s tables.

2. Suppose that the matrix Ai has dimensions P i−1 ∗ Pi .What is the dimension of the matrix
product U = A ∗ A ∗ A . . . Ak?
i i+1 i+2

Longest Common/Increasing Subsequence ( LCS /


LIS )
videos LCS long video - https://youtu.be/sSno9rV8Rhg?si=l2FQx72G89Lr83TO
LIS code video - https://youtu.be/mNrzyuus2h4?si=cglPn7G6RiJy8HYf
MIT's 1 hour lecture on LCS, LIS, Coins - https://youtu.be/KLBCUx1is2c?
si=loSpJu87z8-f_AFb
article https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/
https://cp-algorithms.com/sequences/longest_increasing_subsequence.html

Questions:
1. What is the purpose of LCS?
Ans: The Longest Common Subsequence (LCS) algorithm is used to find the longest
subsequence common to two sequences (strings, arrays, etc.) without rearranging the
order of elements.
2.

Coin-Change Problem ( CCP )


Videos cp ref - https://youtu.be/1mtvm2ubHCY?si=L4YgUkFKb9sxDZCM
Article not recommended - https://www.geeksforgeeks.org/understanding-the-coin-
change-problem-with-dynamic-programming/

Questions:
1. Determine the change that would incur the minimum number of coins for an amount of 47
cents. Use the standard coin denomination values used in the US i.e. 25, 10, 5, 1 cents

0/1 Knapsack Problem


videos abdul bari boring but effective - https://youtu.be/nLmhmB6NzcM?
si=We6cHdredu_KKSYM
Article https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/
https://www.javatpoint.com/0-1-knapsack-problem

Questions:
1. Which key property is shared by both greedy algorithms and dynamic programming?

Computing a Binomial Coefficient


https://www.geeksforgeeks.org/binomial-coefficient-dp-9/

Constructing an optimal Binary Search Tree


https://www.geeksforgeeks.org/introduction-to-binary-search-tree/?ref=lbp

You might also like