- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the time complexity of the Wagne...

Q. |
## 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» C. o(mn) | |

Explanation: the time complexity of the wagner–fischer algorithm is o(mn). |

View all MCQs in:
Design and Analysis of Algorithms

- Consider the two strings “”(empty string) and “abcd”. What is the edit distance between the two strings?
- Consider the strings “monday” and “tuesday”. What is the edit distance between the two strings?
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- Which of the following sorting algorithm has best case time complexity of O(n2)?
- What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the worst case time complexity of a quick sort algorithm?
- What is the time complexity of Kruskal’s algorithm?
- Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?

Login to Continue

It will take less than 2 minutes

Report MCQ