Please zoom in if you have trouble reading the question Select all the answers b

Question

Please zoom in if you have trouble reading the question

Select all the answers below which are TRUE. There is no greedy algorithm that correctly computes the optimal solution. A greedy algorithm makes the choice that looks best at the moment. It makes a locally optimal choice in the hope of obtaining a global optimal solution. Solving the Longest Common Subsequence using Brute Force takes exponential time. Longest Common Subsequence problem has two values for the input size: m and n. To show that a greedy algorithm is an optimal solution, we need to show the optimal substructure property and the greedy choice property. A greedy algorithm is a bottom-up approach.

Explanation / Answer

Answer: Follwing are the correct options-->

  Always makes the choice that seems to be the best at that moment. this the way the greedy algorithum works.

IF you have any query just comment on it

Good luck..!!

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---