MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structure
→
Number Jumps Reach End Array Operation in Data Structure
→
Wagner Fischer is a ____________ algorithm...
1.
Wagner Fischer is a ____________ algorithm.
A.
Brute force
B.
Greedy
C.
Dynamic programming
D.
Recursive
Answer» D. Recursive
Show Answer
Discussion
No Comment Found
Post Comment
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.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply