McqMate

Q. |
## Which of the following is true about the time complexity of the recursive solution of set partition problem? |

A. | it has an exponential time complexity |

B. | it has a linear time complexity |

C. | it has a logarithmic time complexity |

D. | it has a time complexity of o(n2) |

Answer» A. it has an exponential time complexity | |

Explanation: set partition problem has both recursive as well as dynamic programming solution. the recursive solution has an exponential time complexity as it will require to check for all subsets in the worst case. |

3.1k

0

Do you find this helpful?

29

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.
- Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.
- What is the worst case time 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?
- What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- 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?
- What will be the best case time complexity of recursive selection sort?