Question

Circle True or False for each of the following statements. 1) True False A greedy algorithm always makes the choice that looks best at the moment. 2) True False A greedy algorithm makes a globally optimal choice in the hope that this choice will lead to a locally optimal solution. 3) True False Greedy algorithms always yield optimal solutions. 4) True False GREEDY-ACTIVITY-SELECTOR sometimes finds an optimal solution to an instance of the activity-selection problem. 5) True False Two ingredients that are exhibited by most problems that lend themselves to a greedy strategy: the overlapping subproblems and optimal substructure. 6) True False Greedy-choice property: a globally optimal solution can be arrived at by making a locally optimal (greedy) choice. 7) True False A problem exhibits optimal substructure if an optimal solution to the problem contains within it optimal solutions to subproblems. 8) True False The 0-1 knapsack problem is solvable by a greedy strategy, whereas the fractional knapsack problem is not.

          Circle True or False for each of the following statements.
1) True False
A greedy algorithm always makes the choice that looks best at the
moment.
2) True False
A greedy algorithm makes a globally optimal choice in the hope that this
choice will lead to a locally optimal solution.
3) True False
Greedy algorithms always yield optimal solutions.
4) True False
GREEDY-ACTIVITY-SELECTOR sometimes finds an optimal solution to
an instance of the activity-selection problem.
5) True False
Two ingredients that are exhibited by most problems that lend
themselves to a greedy strategy: the overlapping subproblems and
optimal substructure.
6) True False
Greedy-choice property: a globally optimal solution can be arrived at by
making a locally optimal (greedy) choice.
7) True False
A problem exhibits optimal substructure if an optimal solution to the
problem contains within it optimal solutions to subproblems.
8) True False
The 0-1 knapsack problem is solvable by a greedy strategy, whereas the
fractional knapsack problem is not.

$Circle True or False for each of the following statements. 1) True False A greedy algorithm always makes the choice that looks best at the moment. 2) True False A greedy algorithm makes a globally optimal choice in the hope that this choice will lead to a locally optimal solution. 3) True False Greedy algorithms always yield optimal solutions. 4) True False GREEDY-ACTIVITY-SELECTOR sometimes finds an optimal solution to an instance of the activity-selection problem. 5) True False Two ingredients that are exhibited by most problems that lend themselves to a greedy strategy: the overlapping subproblems and optimal substructure. 6) True False Greedy-choice property: a globally optimal solution can be arrived at by making a locally optimal (greedy) choice. 7) True False A problem exhibits optimal substructure if an optimal solution to the problem contains within it optimal solutions to subproblems. 8) True False The 0-1 knapsack problem is solvable by a greedy strategy, whereas the fractional knapsack problem is not.$

Added by Evan H.

Question

Please give Ace some feedback