McqMate

Q. |
## What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)? |

A. | o(n log n) |

B. | o(n2) |

C. | o(2n) |

D. | o(sum*n) |

Answer» D. o(sum*n) | |

Explanation: the auxiliary space complexity of set partition problem is required in order to store the partition table. it takes up a space of n*sum, so its auxiliary space requirement becomes o(n*sum). |

1.6k

0

Do you find this helpful?

3

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.
- What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the space complexity of the following dynamic programming implementation used to find the minimum number of jumps?
- 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?
- 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?
- 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 is the time complexity of the above dynamic programming implementation of the assembly line scheduling problem?
- What is the time complexity of the brute force algorithm used to solve the balanced partition problem?