Greedy Algorithms Quiz

What is a greedy algorithm?

• An algorithm that guarantees the optimal solution

• An algorithm that makes the best choice at each step

• An algorithm that uses backtracking

• An algorithm that explores all possible solutions

Which of the following is a characteristic of greedy algorithms?

• They are always faster than dynamic programming

• They do not consider future consequences

• They always produce the optimal solution

• They require a lot of memory

In which scenario is a greedy algorithm most effective?

• When the problem has overlapping subproblems

• When the problem has no solution

• When the problem has optimal substructure

• When the problem requires exhaustive search

Which of the following problems can be solved using a greedy algorithm?

• Longest common subsequence

• Minimum spanning tree

• Traveling salesman problem

• Knapsack problem

What is the main disadvantage of greedy algorithms?

• They are not applicable to any real-world problems

• They are too complex to implement

• They may not yield the optimal solution

• They require more time than dynamic programming

Which of the following is an example of a greedy algorithm?

• Dijkstra's algorithm

• Merge sort

• Breadth-first search

• Dynamic programming

What is the time complexity of a greedy algorithm for the minimum spanning tree?

• O(n log n)

• O(n^2)

• O(n)

• O(log n)

Which greedy algorithm is used to solve the Huffman coding problem?

• Kruskal's algorithm

• Huffman algorithm

• Dijkstra's algorithm

• Prim's algorithm

What is the primary strategy of a greedy algorithm?

• To divide the problem into smaller subproblems

• To use recursion to find the solution

• To make a series of choices that seem best at the moment

• To explore all possible solutions

Which of the following is NOT a greedy algorithm?

• Prim's algorithm

• Fractional knapsack problem

• Bellman-Ford algorithm

• Kruskal's algorithm