Lille Stadium Ahead of Russia & Slovakia Match for Euro 2016

What is the primary characteristic of a greedy algorithm?

• It is slower than other algorithms.

• It requires backtracking to find solutions.

• It makes the locally optimal choice at each step.

• It always finds the global optimum.

In which scenario is a greedy algorithm most effective?

• When the problem has overlapping subproblems.

• When the problem has a dynamic programming solution.

• When the problem can be divided into independent subproblems.

• When the problem requires exhaustive search.

Which of the following is a limitation of greedy algorithms?

• They require a lot of memory.

• They are difficult to implement.

• They may not find the optimal solution.

• They are always inefficient.

Which real-world problem can be solved using a greedy algorithm?

• Calculating the factorial of a number.

• Solving a system of linear equations.

• Sorting a list of numbers.

• Finding the shortest path in a weighted graph.

What is a common application of greedy algorithms?

• Data encryption.

• Network routing.

• Image processing.

• Database indexing.