Question
#include<stdio.h>
#include<string.h>
int max_num(int a, int b)
{
if(a > b)
return a;
return b;
}
int lcs(char *str1, char *str2)
{
int i,j,len1,len2;
len1 = strlen(str1);
len2 = strlen(str2);
int arr[len1 + 1][len2 + 1];
for(i = 0; i <= len1; i++)
arr[i][0] = 0;
for(i = 0; i <= len2; i++)
arr[0][i] = 0;
for(i = 1; i <= len1; i++)
{
for(j = 1; j <= len2; j++)
{
if(str1[i-1] == str2[j - 1])
arr[i][j] = 1 + arr[i - 1][j - 1];
else
arr[i][j] = max_num(arr[i - 1][j], arr[i][j - 1]);
}
}
return arr[len1][len2];
}
int main()
{
char str1[] = "hbcfgmnapq", str2[] = "cbhgrsfnmq";
int ans = lcs(str1,str2);
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 value stored in arr[2][3] when the following code is executed?
Similar Questions
Discover Related MCQs
Q. Which of the following methods can be used to solve the longest palindromic subsequence problem?
View solution
Q. Which of the following strings is a palindromic subsequence of the string “ababcdabba”?
View solution
Q. For which of the following, the length of the string is equal to the length of the longest palindromic subsequence?
View solution
Q. What is the length of the longest palindromic subsequence for the string “ababcdabba”?
View solution
Q. What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?
View solution
Q. For every non-empty string, the length of the longest palindromic subsequence is at least one.
View solution
Q. Longest palindromic subsequence is an example of ______________
View solution
Q. Which of the following methods can be used to solve the edit distance problem?
View solution
Q. The edit distance satisfies the axioms of a metric when the costs are non-negative.
View solution
Q. Which of the following is an application of the edit distance problem?
View solution
Q. In which of the following cases will the edit distance between two strings be zero?
View solution
Q. Suppose each edit (insert, delete, replace) has a cost of one. Then, the maximum edit distance cost between the two strings is equal to the length of the larger string.
View solution
Q. Consider the strings “monday” and “tuesday”. What is the edit distance between the two strings?
View solution
Q. Consider the two strings “”(empty string) and “abcd”. What is the edit distance between the two strings?
View solution
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
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!
