- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Recursive solution of subset sum problem...

Q. |
## Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity. |

A. | true |

B. | false |

Answer» B. false | |

Explanation: the recursive solution to subset sum problem takes exponential time complexity whereas the dynamic programming solution takes polynomial time complexity. so dynamic programming solution is faster in terms of time complexity. |

View all MCQs in:
Design and Analysis of Algorithms

- Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.
- Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
- What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?
- What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- Which of the following is true about the time complexity of the recursive solution of set partition problem?
- Subset sum problem is an example of NP- complete problem.
- How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?
- What is the time complexity of the above recursive implementation used to reverse a string?
- What will be the best case time complexity of recursive selection sort?

Login to Continue

It will take less than 2 minutes

Report MCQ