

MCQOPTIONS
Saved Bookmarks
1. |
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. | None of the mentioned |
Answer» D. None of the mentioned | |