Longest Palindromic Subsequence MCQ

Test your knowledge with important Longest Palindromic Subsequence MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Longest Palindromic Subsequence MCQs at Bissoy

• Longest palindromic subsequence is an example of ______________
  ক

  Greedy algorithm

  খ

  2D dynamic programming

  গ

  1D dynamic programming

  ঘ

  Divide and conquer
• For every non-empty string, the length of the longest palindromic subsequence is at least one.
  ক

  True

  খ

  False
• What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?
  ক

  O(1)

  খ

  O(2n)

  গ

  O(n)

  ঘ

  O(n2)
• What is the length of the longest palindromic subsequence for the string “ababcdabba”?
  ক

  6

  খ

  7

  গ

  8

  ঘ

  9
• For which of the following, the length of the string is not equal to the length of the longest palindromic subsequence?
  ক

  A string that is a palindrome d) Some strings of length two View Answer]

  খ

  A string of length one

  গ

  A string that has all the same letters(e.g. aaaaaa)

  ঘ

  Some strings of length two
• Which of the following is not a palindromic subsequence of the string “ababcdabba”?
  ক

  abcba

  খ

  abba

  গ

  abbbba

  ঘ

  adba
• Which of the following methods can be used to solve the longest palindromic subsequence problem?
  ক

  Dynamic programming

  খ

  Recursion

  গ

  Brute force

  ঘ

  Dynamic programming, Recursion, Brute force