Q74
The 0-1 Knapsack problem can be solved using Greedy algorithm.
A.
True
B.
False
AnswerAnswer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board