Wagner Fischer algorithm is used to find ____________ – McqOptions

MCQOPTIONS

1.	Wagner Fischer algorithm is used to find ____________
A.	Longest common subsequence
B.	Longest increasing subsequence
C.	Edit distance between two strings
D.	Longest decreasing subsequence
Answer» D. Longest decreasing subsequence

Discussion

No Comment Found

Related MCQs

What is the space complexity of the above implementation of Wagner Fischer algorithm where "m" and "n" are the lengths of the two strings?
What is the time complexity of the Wagner Fischer algorithm where "m" and "n" are the lengths of the two strings?
What is the edit distance between the strings abcd and acbd when the allowed operations are insertion, deletion and substitution?
Wagner Fischer algorithm is used to find ____________
Wagner Fischer is a ____________ algorithm.