McqMate

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

A. | true |

B. | false |

Answer» B. false | |

Explanation: the recursive solution to set partition 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. |

1.5k

0

Do you find this helpful?

17

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Recursive solution of subset sum 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 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)?
- Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
- 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?
- 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?
- What is the time complexity of the brute force algorithm used to solve the balanced partition 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?