McqMate

Q. |
## Which of the following problems is NOT solved using dynamic programming? |

A. | 0/1 knapsack problem |

B. | matrix chain multiplication problem |

C. | edit distance problem |

D. | fractional knapsack problem |

Answer» D. fractional knapsack problem | |

Explanation: the fractional knapsack problem is solved using a greedy algorithm. |

4.1k

0

Do you find this helpful?

36

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Which of the following problems should be solved using dynamic programming?
- In what time can the Hamiltonian path problem can be solved using dynamic programming?
- Which of the following problems can’t be solved using recursion?
- Which of the following problems can be solved using the longest subsequence problem?
- A greedy algorithm can be used to solve all the dynamic programming problems.
- Problems that can be solved in polynomial time are known as?
- is the class of decision problems that can be solved by non- deterministic polynomial algorithms?
- Problems that cannot be solved by any algorithm are called?
- The dynamic programming implementation of the maximum sum rectangle problem uses which of the following algorithm?
- What is the space complexity of the following dynamic programming implementation used to find the minimum number of jumps?