- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following methods can be us...

Q. |
## Which of the following methods can be used to solve the edit distance problem? |

A. | recursion |

B. | dynamic programming |

C. | both dynamic programming and recursion |

D. | greedy algorithm |

Answer» C. both dynamic programming and recursion | |

Explanation: both dynamic programming and recursion can be used to solve the edit distance problem. |

View all MCQs in:
Design and Analysis of Algorithms

- Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?
- You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?
- Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?
- 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.
- Which of the following methods can be used to solve the matrix chain multiplication problem?
- Which of the following methods can be used to solve the longest common subsequence problem?
- Which of the following methods can be used to solve the longest palindromic subsequence problem?
- Which of the following methods can be used to solve the assembly line scheduling problem?
- 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?
- Given a 2D matrix, find a submatrix that has the maximum sum. Which of the following methods can be used to solve this problem?

Login to Continue

It will take less than 2 minutes

Report MCQ