McqMate
| Q. |
The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using |
| A. | recursion |
| B. | dynamic programming |
| C. | brute force |
| D. | recursion, dynamic programming, brute force |
| Answer» D. recursion, dynamic programming, brute force | |
| Explanation: the longest increasing subsequence problem can be solved using all of the mentioned methods. | |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet