McqMate

Q. |
## Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the longest common subsequence? |

A. | 9 |

B. | 8 |

C. | 7 |

D. | 6 |

Answer» C. 7 | |

Explanation: the longest common subsequence is “prtpqrs” and its length is 7. |

3.3k

0

Do you find this helpful?

1

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 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?
- Consider the strings “monday” and “tuesday”. What is the edit distance between the two strings?
- Consider the two strings “”(empty string) and “abcd”. What is the edit distance between the two strings?
- For any given sequence, there will ALWAYS be a unique increasing subsequence with the longest length.
- 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 methods can be used to solve the longest common subsequence problem?