[Solved] Longest palindromic subsequence is an example of

Computer Science Engineering (CSE)
Design and Analysis of Algorithms
Longest palindromic subsequence is an ex...

Q.	Longest palindromic subsequence is an example of
A.	greedy algorithm
B.	2d dynamic programming
C.	1d dynamic programming
D.	divide and conquer
Answer» B. 2d dynamic programming
Explanation: longest palindromic subsequence is an example of 2d dynamic programming.

View all MCQs in: Design and Analysis of Algorithms

Discussion

Related Questions

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
Which of the following methods can be used to solve the longest palindromic subsequence problem?
For which of the following, the length of the string is not equal to the length of the longest palindromic subsequence?
What is the length of the longest palindromic subsequence for the string “ababcdabba”?
What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?
For every non-empty string, the length of the longest palindromic subsequence is at least one.
Which of the following is not a palindromic subsequence of the string “ababcdabba”?
Longest common subsequence is an example of
For any given sequence, there will ALWAYS be a unique increasing subsequence with the longest length.
Which of the following methods can be used to solve the longest common subsequence problem?