## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## Data Structure Questions and Answers-Dynamic Programming

## Click on any option to know the CORRECT ANSWERS

Question 1 |

Which of the following is/are property/properties of a dynamic programming problem?

Optimal substructure | |

Overlapping subproblems | |

Greedy approach | |

Both optimal substructure and overlapping subproblems |

**Management Questions answers**

Question 1 Explanation:

A problem that can be solved using dynamic programming possesses overlapping subproblems as well as optimal substructure properties.

Question 2 |

If an optimal solution can be created for a problem by constructing optimal solutions for its subproblems, the problem possesses ..... property.

Overlapping subproblems | |

Optimal substructure | |

Memoization | |

Greedy |

**UPSC Questions answers**

Question 2 Explanation:

Optimal substructure is the property in which an optimal solution is found for the problem by constructing optimal solutions for the subproblems.

Question 3 |

If a problem can be broken into subproblems which are reused several times, the problem possesses ..... property.

Overlapping subproblems | |

Optimal substructure | |

Memoization | |

Greedy |

**Journalism Questions answers**

Question 3 Explanation:

Overlapping subproblems is the property in which value of a subproblem is used several times.

Question 4 |

If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called .....

Dynamic programming | |

Greedy | |

Divide and conquer | |

Recursion |

**Computer science Questions answers**

Question 4 Explanation:

In divide and conquer, the problem is divided into smaller non-overlapping subproblems and an optimal solution for each of the subproblems is found. The optimal solutions are then combined to get a global optimal solution. For example, mergesort uses divide and conquer strategy.

Question 5 |

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.

True | |

False |

**Visual arts Questions answers**

Question 5 Explanation:

Dynamic programming calculates the value of a subproblem only once, while other methods that don't take advantage of the overlapping subproblems property may calculate the value of the same subproblem several times. So, dynamic programming saves the time of recalculation and takes far less time as compared to other methods that don't take advantage of the overlapping subproblems property.

There are 5 questions to complete.