MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
Given 0-1 knapsack problem and fractional knapsack problem and the following statements:S1: 0-1 knapsack is efficiently solved using Greedy algorithm.S2: Fractional knapsack is efficiently solved using Dynamic programming.Which of the following is true? |
| A. | S1 is correct and S2 is not correct. |
| B. | Both S1 and S2 are correct. |
| C. | Both S1 and S2 are not correct. |
| D. | S1 is not correct and S2 is correct. |
| Answer» D. S1 is not correct and S2 is correct. | |