MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure Questions and Answers 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) | |
| 2. |
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 | |
| 3. |
Wagner–Fischer is a ____________ algorithm. |
| A. | Brute force |
| B. | Greedy |
| C. | Dynamic programming |
| D. | Recursive |
| Answer» D. Recursive | |