- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following is not a palindro...

Q. |
## Which of the following is not a palindromic subsequence of the string “ababcdabba”? |

A. | abcba |

B. | abba |

C. | abbbba |

D. | adba |

Answer» D. adba | |

Explanation: ‘adba’ is not a palindromic sequence. |

View all MCQs in:
Design and Analysis of Algorithms

- What is the length of the longest palindromic subsequence for the string “ababcdabba”?
- 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
- For which of the following, the length of the string is not equal to 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 methods can be used to solve the longest palindromic subsequence problem?
- What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?
- Longest palindromic subsequence is an example of
- Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?
- In the worst case, the minimum number of insertions to be made to convert the string into a palindrome is equal to the length of the string.
- Consider the string “abbccbba”. What is the minimum number of insertions required to make the string a palindrome?

Login to Continue

It will take less than 2 minutes

Report MCQ