adplus-dvertising
frame-decoration

Question

Wagner–Fischer is a ____________ algorithm.

a.

Brute force

b.

Greedy

c.

Dynamic programming

d.

Recursive

Answer: (c).Dynamic programming

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Wagner–Fischer is a ____________ algorithm.

Similar Questions

Discover Related MCQs

Q. Wagner–Fischer algorithm is used to find ____________

Q. What is the edit distance between the strings “abcd” and “acbd” when the allowed operations are insertion, deletion and substitution?

Q. For which of the following pairs of strings is the edit distance maximum?

Q. What is the time complexity of the Wagner–Fischer algorithm where “m” and “n” are the lengths of the two strings?

Q. Which of the following is NOT a Catalan number?

Q. Which of the following numbers is the 6th Catalan number?

Q. Which of the following is/are applications of Catalan numbers?

Q. Which of the following methods can be used to find the nth Catalan number?

Q. Which of the following implementations of Catalan numbers has the smallest time complexity?

Q. Which of the following implementations of Catalan numbers has the largest space complexity(Don’t consider the stack space)?

Q. Which of the following methods can be used to solve the assembly line scheduling problem?

Q. What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?

Q. In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required?

Q. Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?

Q. In which of the following cases will the number of insertions to form a palindrome be minimum?

Q. In the worst case, the minimum number of insertions to be made to convert the string into a palindrome is equal to the length of the string.

Q. Consider the string “efge”. What is the minimum number of insertions required to make the string a palindrome?

Q. Consider the string “abbccbba”. What is the minimum number of insertions required to make the string a palindrome?

Q. Which of the following problems can be used to solve the minimum number of insertions to form a palindrome problem?

Q. Given a 2D matrix, find a submatrix that has the maximum sum. Which of the following methods can be used to solve this problem?