- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- In dynamic programming, the technique of...

Q. |
## In dynamic programming, the technique of storing the previously calculated values is called |

A. | saving value property |

B. | storing value property |

C. | memoization |

D. | mapping |

Answer» C. memoization | |

Explanation: memoization is the technique |

View all MCQs in:
Design and Analysis of Algorithms

- When dynamic programming is applied to a problem, it takes far less time as compared to other methods that don’t take advantage of overlapping subproblems.
- A greedy algorithm can be used to solve all the dynamic programming problems.
- When a top-down approach of dynamic programming is applied to a problem, it usually
- Which of the following problems is NOT solved using dynamic programming?
- Which of the following problems should be solved using dynamic programming?
- You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?
- What is the space complexity of the following dynamic programming implementation used to find the minimum number of jumps?
- In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required?
- What is the time complexity of the above dynamic programming implementation of the assembly line scheduling problem?
- The dynamic programming implementation of the maximum sum rectangle problem uses which of the following algorithm?

Login to Continue

It will take less than 2 minutes

Report MCQ