Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

Question

Solve all of them!

9. Divide-and-Conquer and Dynamic Programming. This question has been on a final exam.
(a) What does dynamic programming have in common with divide-and-conquer? What is a principal
difference between them?
(b) A recurrence for the number of combinations of m things out of n, ("), for n > 1 and 0< m < n:
n
if m = 0 or m = m
(") + () if 0 < m < n
Here is a recursive function comb taking two integer parameters n and m that returns (").
int comb( int n, int m ){
0 ) || ( m ==
if( ( m ==
n ) )
return 1;
else return( C( n-1,
m ) + C( n-1, m-1 ) );
}
Though this is not an optimization problem, convince yourself that the function computes many
subproblems over and over and that a dynamic programming approach can be applied to this
problem. Consider drawing the recursion tree to see this.
i. Modify the function comb to compute () using a top-down dynamic programming approach
using memoization (i.e., , a table). The table required here is two-dimensional, n x m.
ii. Solve the problem bottom-up with memoization.
expand button
Transcribed Image Text:9. Divide-and-Conquer and Dynamic Programming. This question has been on a final exam. (a) What does dynamic programming have in common with divide-and-conquer? What is a principal difference between them? (b) A recurrence for the number of combinations of m things out of n, ("), for n > 1 and 0< m < n: n if m = 0 or m = m (") + () if 0 < m < n Here is a recursive function comb taking two integer parameters n and m that returns ("). int comb( int n, int m ){ 0 ) || ( m == if( ( m == n ) ) return 1; else return( C( n-1, m ) + C( n-1, m-1 ) ); } Though this is not an optimization problem, convince yourself that the function computes many subproblems over and over and that a dynamic programming approach can be applied to this problem. Consider drawing the recursion tree to see this. i. Modify the function comb to compute () using a top-down dynamic programming approach using memoization (i.e., , a table). The table required here is two-dimensional, n x m. ii. Solve the problem bottom-up with memoization.
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education