Question
#include<stdio.h>
#include<string.h>
int get_min(int a, int b)
{
if(a < b)
return a;
return b;
}
int edit_distance(char *s1, char *s2)
{
int len1,len2,i,j,min;
len1 = strlen(s1);
len2 = strlen(s2);
int arr[len1 + 1][len2 + 1];
for(i = 0;i <= len1; i++)
arr[i][0] = i;
for(i = 0; i <= len2; i++)
arr[0][i] = i;
for(i = 1; i <= len1; i++)
{
for(j = 1; j <= len2; j++)
{
min = get_min(arr[i-1][j],arr[i][j-1]) + 1;
if(s1[i - 1] == s2[j - 1])
{
if(arr[i-1][j-1] < min)
min = arr[i-1][j-1];
}
else
{
if(arr[i-1][j-1] + 1 < min)
min = arr[i-1][j-1] + 1;
}
arr[i][j] = min;
}
}
return arr[len1][len2];
}
int main()
{
char s1[] = "abcd", s2[] = "defg";
int ans = edit_distance(s1, s2);
printf("%d",ans);
return 0;
}
a.
1
b.
2
c.
3
d.
4
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. What is the output of the following code?
Similar Questions
Discover Related MCQs
Q. Wagner–Fischer is a ____________ algorithm.
View solution
Q. Wagner–Fischer algorithm is used to find ____________
View solution
Q. What is the edit distance between the strings “abcd” and “acbd” when the allowed operations are insertion, deletion and substitution?
View solution
Q. For which of the following pairs of strings is the edit distance maximum?
View solution
Q. What is the time complexity of the Wagner–Fischer algorithm where “m” and “n” are the lengths of the two strings?
View solution
Q. Which of the following is NOT a Catalan number?
View solution
Q. Which of the following numbers is the 6th Catalan number?
View solution
Q. Which of the following is/are applications of Catalan numbers?
View solution
Q. Which of the following methods can be used to find the nth Catalan number?
View solution
Q. Which of the following implementations of Catalan numbers has the smallest time complexity?
View solution
Q. Which of the following implementations of Catalan numbers has the largest space complexity(Don’t consider the stack space)?
View solution
Q. Which of the following methods can be used to solve the assembly line scheduling problem?
View solution
Q. What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?
View solution
Q. In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required?
View solution
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?
View solution
Q. In which of the following cases will the number of insertions to form a palindrome be minimum?
View solution
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.
View solution
Q. Consider the string “efge”. What is the minimum number of insertions required to make the string a palindrome?
View solution
Q. Consider the string “abbccbba”. What is the minimum number of insertions required to make the string a palindrome?
View solution
Q. Which of the following problems can be used to solve the minimum number of insertions to form a palindrome problem?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)