Seatwork Greedy Algorithm Data Structure

Greedy Algorithm was ______ in its approach.

• Longsighted

• Greedy

• Shortsighted

• Optimized

The distinction between a greedy algorithm and a dynamic programming algorithm is that

solutions to the sub-problems do not always need to be known at each stage.

• Sub-problems

• Main-problems

• Optimization problems

• Problems

It is an approach to solving a problem by selecting the best option available at the

moment.

• Dynamic programming

• Algorithm

• Optimization

• Greedy Algorithm

Greedy algorithm works in _____ approach.

• Bottom-up

• Top-down

• Top-up

• Bottom-down

Greedy algorithm ____ the problem into multiple steps (sub-problems).

• Multiply

• Divide

• Add

• Subtract

An optimization problem is one in which you want to find, not just a solution ; but

the____.

• Best solution

• Easiest solution

• Fastest solution

• Optimized solution

Greedy algorithm sometimes works well on what type of problems?

• Optimization problem

• Algorithmic problem

• Programming problem

• Arithmetic problem

For the US (United States) Monetary system, the greedy algorithm ____ gives the

optimum solution.

• Sometimes

• Never

• Always

• Seldom

Greedy algorithms make good local choices in the hope that they will result in: (Choose 2

answers)

• An optimal solution

• An easiest solution

• A best solution

• A feasible solution

To construct the solution optimally. The greedy algorithm maintains two sets: (Choose 2

answers)

• Contains chosen items

• Contains rejected items

• Contains needed items

• Contains all items