1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. Which of the following methods can be us...
Q.

Which of the following methods can be used to solve the longest common subsequence problem?

A. recursion
B. dynamic programming
C. both recursion and dynamic programming
D. greedy algorithm
Answer» C. both recursion and dynamic programming
Explanation: both recursion and dynamic programming can be used to solve the longest subsequence problem.

Discussion