Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged longest-common-subsequence
2.5k
views
2
answers
0
votes
A Different Kind of Question on Longest Common Subsequence
Consider two strings A = "anandarmy" and B = "algorithms". Let y' be the length of the longest common subsequence (not necessarily contiguous) between A and ... of such longest common subsequences between A and B. Then 2x+3y = _________.
gmrishikumar
2.5k
views
gmrishikumar
asked
Jan 22, 2019
Algorithms
algorithms
longest-common-subsequence
dynamic-programming
numerical-answers
+
–
392
views
1
answers
0
votes
#self doubt #Lcs
How many distinct function calls are there in LCS(m,n)=. How to calculate it?
Rustam Ali
392
views
Rustam Ali
asked
Sep 11, 2018
Algorithms
algorithms
dynamic-programming
longest-common-subsequence
descriptive
+
–
2.2k
views
2
answers
2
votes
MadeEasy Test Series: Algorithms - Dynamic Programming
Consider two strings A = “abbaccda” and B = “abcaa” consider "x"be length of the longest common subsequence between A and B and “y” be the number of distinct such longest common subsequences between A and B. Then 10x+ 2y is ________.
talha hashim
2.2k
views
talha hashim
asked
Aug 1, 2018
Algorithms
algorithms
dynamic-programming
made-easy-test-series
longest-common-subsequence
+
–
427
views
0
answers
1
votes
[ALGO] LCS - self doubt
Consider two strings A = 12341 and B = 341213 .The length of LCS is 3 and they are "121", "123", "341"Now there are two possibilities for the ... be the total no. of subsequence possible 3 or 4(because of two possibilities of "341")
ashish pal
427
views
ashish pal
asked
Jan 22, 2018
Algorithms
algorithms
longest-common-subsequence
+
–
484
views
0
answers
2
votes
Longest Common Sub sequence
We wish to find the longest common palindromic subsequence in a string. Read the above code snippet and choose the missing statements.a)S1: DP[i][j]=0; S2: DP[i][j] =1+DP[i+1][j-1] S3: ... ][j] =2+DP[i+1][j-1] S3: DP[i+1][j] ,DP[i+1][j-1]
shaurya vardhan
484
views
shaurya vardhan
asked
Nov 6, 2017
Algorithms
algorithms
longest-common-subsequence
+
–
938
views
0
answers
1
votes
Introduction to algorithms by Cormen
Determine an LCS of {1,0,0,1,0,1,0,1} (assume A) and {0,1,0,1,1,0,1,1,0} (assume B)If we draw the matrix and ... , how come while backtracking it gives this as a solution.https://gateoverflow.in/?qa=blob&qa_blobid=3569576287134533309
Akshata
938
views
Akshata
asked
Jul 16, 2017
Algorithms
algorithms
longest-common-subsequence
+
–
1.4k
views
1
answers
3
votes
Longest Common Subsequence
For finding longest common subsequence(LCS), standard sources mention that the recursive procedure consisting of the recursive tree occupies O(m+n) space( WITHOUT applying Dynamic ... space should be k=log(m+n).What's wrong with my logic?
Bongbirdie
1.4k
views
Bongbirdie
asked
May 17, 2017
Algorithms
algorithms
longest-common-subsequence
dynamic-programming
+
–
6.4k
views
3
answers
4
votes
UGC NET CSE | December 2015 | Part 3 | Question: 17
Given two sequences $X$ and $Y$:$X=\langle a, b, c, b, d, a, b \rangle$Y=\langle b, d, c, a, b, a \rangle$The longest common subsequence of X and Y is:$\langle b ... $\langle b, c, b, a \rangle$
go_editor
6.4k
views
go_editor
asked
Aug 9, 2016
Algorithms
ugcnetcse-dec2015-paper3
algorithms
longest-common-subsequence
+
–
9.7k
views
2
answers
2
votes
longest common subsequence
For X= BDCABA and Y=ABCBDAB find length of lcs and no of such lcs..(solve it using table method)
Pooja Palod
9.7k
views
Pooja Palod
asked
Dec 1, 2015
Algorithms
dynamic-programming
numerical-answers
longest-common-subsequence
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register