The 0-1 Knapsack problem can be solved using Greedy algorithm.

Related Questions

• Fractional knapsack problem is solved most efficiently by which of the following algorithm?
• Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct?
• Fractional knapsack problem can be solved in time O(n).
• The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
• The result of the fractional knapsack is greater than or equal to 0/1 knapsack.
• Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
• You are given infinite coins of 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. This problem can be solved using
• A greedy algorithm can be used to solve all the dynamic programming problems.
• The first step in the naïve greedy algorithm is?
• In what time can the Hamiltonian path problem can be solved using dynamic programming?