- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- The Knapsack problem is an example of

Q. |
## The Knapsack problem is an example of |

A. | greedy algorithm |

B. | 2d dynamic programming |

C. | 1d dynamic programming |

D. | divide and conquer |

Answer» B. 2d dynamic programming | |

Explanation: knapsack problem is an example of 2d dynamic programming. |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct?
- The result of the fractional knapsack is greater than or equal to 0/1 knapsack.
- Which of the following problems is equivalent to the 0-1 Knapsack problem?
- The 0-1 Knapsack problem can be solved using Greedy algorithm.
- Fractional knapsack problem is also known as
- Fractional knapsack problem is solved most efficiently by which of the following algorithm?
- What is the objective of the knapsack problem?
- Time complexity of fractional knapsack problem is
- Fractional knapsack problem can be solved in time O(n).
- The main time taking step in fractional knapsack problem is

Login to Continue

It will take less than 2 minutes

Report MCQ