Home » MCQs » Algorithms MCQs

In the context of the LCS problem, which approach uses a 2D array to store the lengths of common subsequences?

36. In the context of the LCS problem, which approach uses a 2D array to store the lengths of common subsequences?

1. Greedy Algorithm
2. Divide and Conquer
3. Dynamic Programming (Bottom-Up)
4. Backtracking

Answer

The correct answer is: C) Dynamic Programming (Bottom-Up)

Explanation

The bottom-up dynamic programming approach uses a 2D array to store the lengths of common subsequences.