Greedy Algorithms Quiz Online Practice Questions

1. Which of the following statements about Kruskal’s algorithm is Incorrect?

It builds the MST by selecting edges in increasing order of weight.

It is a greedy algorithm.

It uses the union-find data structure.

It always selects the edge with the highest weight.

2. Which algorithm is the most efficient for solving the Fractional Knapsack problem?

Branch and Bound

Dynamic programming

Divide and conquer

Greedy algorithm

3. What is the initial step when executing the naïve greedy algorithm for maximum flow?

Adding flows with higher capacity values

Reversing existing flow if necessary

Analysing the zero-flow state

Finding augmenting paths using depth-first search

4. Suppose you have coins of denominations 1, 4, and 6. A greedy algorithm always selects the largest coin that does not exceed the remaining amount. For which of the following sums does this algorithm produce an optimal solution?

120

5. Which of the following statements is correct?

Branch and bound is unsuitable when a greedy algorithm cannot be applied

Branch and bound divides a problem into two or more restricted subproblems.

Backtracking divides a problem into two or more restricted subproblems.

Branch and bound is more efficient than backtracking.

6. Dijkstra’s algorithm is a classic example of which algorithmic technique?

Greedy algorithm

Brute-force

Backtracking

Branch and bound

7. Bellman–Ford algorithm is an example of which algorithmic technique?

Linear programming

Greedy algorithm

Dynamic programming

Divide and conquer

8. Which algorithmic approach is most suitable for constructing Huffman codes?

Exhaustive search

Dynamic programming

Brute-force algorithm

Greedy algorithm

Test Name:	Greedy Algorithms
Subject Category:	Design & Analysis of Algorithms
Test Type:	Multiple Choice Questions
Total Score / Questions:	8 / 8
Time Allowed:	5 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Greedy Algorithms MCQs Online Practice Test Quiz