Explore topic-wise MCQs in Data Structure.

This section includes 5 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.

1.

What is the space complexity of the above implementation of Wagner Fischer algorithm where "m" and "n" are the lengths of the two strings?

A. O(1)
B. O(n+m)
C. O(mn)
D. O(nlogm)
Answer» D. O(nlogm)
Discussion
2.

What is the time complexity of the Wagner Fischer algorithm where "m" and "n" are the lengths of the two strings?

A. O(1)
B. O(n+m)
C. O(mn)
D. O(nlogm)
Answer» D. O(nlogm)
Discussion
3.

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

A. 1
B. 2
C. 3
D. 4
Answer» C. 3
Discussion
4.

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
5.

Wagner Fischer is a ____________ algorithm.

A. Brute force
B. Greedy
C. Dynamic programming
D. Recursive
Answer» D. Recursive
Discussion