M

Mr. Dubey • 52.30K Points
Coach 

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

(A) true
(B) false
(C) ---
(D) ---
Correct : Option (B)

Explanation: 
 the knapsack problem cannot be solved using the greedy algorithm.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which symbol will be used with grep command to match the pattern pat at the end of a line?

Q. _____________________where a VM can be moved from one physical machine to another even as it continues to execute.

Q. Power set of empty set has exactly _____ subset.

Q. Which data type is used to represent the absence of parameters?

Q. The right hand side of an association rule is called _____.

Q. Formal testing conducted to determine whether a system satisfies its acceptance criteria and to enable the customer to determine whether to accept the

Q. Suppose the first fibonnaci number is 0 and the second is 1. What is the sixth fibonnaci number?

Q. If in a shift resistor Q0 is fed back to input the resulting counter is

Q. What does ~4 evaluate to?

Q. Which of the following is not an objective for building analysis models?