GATE | CS | 2014 | Set 2 | Algorithms | Dynamic Programming | Question 5

Last Updated :
Discuss
Comments

Consider two strings A = "qpqrr" and B = "pqprqrp". Let x be the length of the longest common subsequence (not necessarily contiguous) between A and B and let y be the number of such longest common subsequences between A and B. Then x + 10y = ___.

33

23

43

34

This question is part of this quiz :

Top MCQs on Dynamic Programming with Answers,GATE-CS-2014-(Set-2),Top 50 Algorithms MCQs with Answers,Algorithms GATE CS PYQ Quiz,Dynamic Programming GATE CS PYQ Quiz
Tags:
DSA Quiz
GATE
Algorithms
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy