Midterm Exam

What is the main approach of a Greedy Algorithm?

• Making the best choice at each stage

• Using random selection

• Revising previous choices

• Considering all possible options

Which of the following is a key characteristic of Greedy Algorithms?

• Backtracking

• Recursive Approach

• Dynamic Programming

• Local Optimal Choice

What does 'Irrevocability' in Greedy Algorithms mean?

• Once a decision is made, it cannot be changed

• Decisions are made randomly

• Choices can be changed later

• All choices are reversible

Which problem type is Greedy Algorithm particularly suited for?

• Problems needing backtracking

• Problems requiring exhaustive search

• Problems with optimal substructure

• Problems with no clear structure

What is one advantage of using Greedy Algorithms?

• They are easy to understand and implement

• They require complex calculations

• They are suitable for all problem types

• They always provide the best solution

What is a limitation of Greedy Algorithms?

• They require more time than other methods

• They are too complex to implement

• They may not provide the best solution for all problems

• They are always optimal

In the Coin Change Problem, what is the Greedy Strategy?

• Pick the smallest denomination first

• Choose denominations randomly

• Use all denominations equally

• Pick the largest denomination that is less than or equal to the remaining amount

What is the total number of coins used in the example provided for the amount of 63?

• 5 coins

• 6 coins

• 7 coins

• 8 coins

What is the first step in the working principle of Greedy Algorithms?

• Feasibility check

• Final decision making

• Selection of the best option

• Solution formulation

What is a common example of a problem solved by Greedy Algorithms?

• Coin change problem

• Matrix multiplication

• Graph traversal

• Sorting algorithms