Which of the following problems can be solved by a standard Greedy algorithm?

I. Finding a minimum cost spanning tree in an undirected graph.

II. Finding a single maximal clique in a graph.

III. Finding a longest common subsequence in a given string.

1
I, II
2
I,II,III
3
III only
4
I only

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation