McqMate

Q. |
## Which of the following problems can be solved using the longest subsequence problem? |

A. | longest increasing subsequence |

B. | longest palindromic subsequence |

C. | longest bitonic subsequence |

D. | longest decreasing subsequence |

Answer» B. longest palindromic subsequence | |

Explanation: to find the longest palindromic subsequence in a given string, reverse the given string and then find the longest common subsequence in the given string and the reversed string. |

763

0

Do you find this helpful?

10

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- 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 common subsequence problem?
- Which of the following methods can be used to solve the longest palindromic subsequence problem?
- You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using
- Which of the following is the longest common subsequence between the strings “hbcfgmnapq” and “cbhgrsfnmq” ?
- For which of the following, the length of the string is not equal to the length of the longest palindromic subsequence?
- For any given sequence, there will ALWAYS be a unique increasing subsequence with the longest length.
- Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the longest common subsequence?
- Longest common subsequence is an example of
- What is the time complexity of the brute force algorithm used to find the longest common subsequence?