- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Recursion is a method in which the solut...

Q. |
## Recursion is a method in which the solution of a problem depends on |

A. | larger instances of different problems |

B. | larger instances of the same problem |

C. | smaller instances of the same problem |

D. | smaller instances of different problems |

Answer» C. smaller instances of the same problem | |

Explanation: in recursion, the solution of a problem depends on the solution of smaller instances of the same problem. |

View all MCQs in:
Design and Analysis of Algorithms

- Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.
- Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.
- Recursion is similar to which of the following?
- Which of the following problems can’t be solved using recursion?
- 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?
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
- Which of the following is true about the time complexity of the recursive solution of set partition problem?
- What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?

Login to Continue

It will take less than 2 minutes

Report MCQ