- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- In divide and conquer, the time is taken...

Q. |
## In divide and conquer, the time is taken for merging the subproblems is? |

A. | o(n) |

B. | o(n log n) |

C. | o(n2) |

D. | o(log n) |

Answer» B. o(n log n) | |

Explanation: the time taken for merging the smaller subproblems in a divide and conquer approach is mathematically found to be o(n log n). |

View all MCQs in:
Design and Analysis of Algorithms

- What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
- What is the optimal time required for solving the closest pair problem using divide and conquer approach?
- The optimal time obtained through divide and conquer approach using merge sort is the best case efficiency.
- Quick sort follows Divide-and-Conquer strategy.
- What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
- When dynamic programming is applied to a problem, it takes far less time as compared to other methods that don’t take advantage of overlapping subproblems.
- If a problem can be broken into subproblems which are reused several times, the problem possesses property.
- How many sub arrays does the quick sort algorithm divide the entire array into?
- The time is taken to find the ‘n’ points that lie in a convex quadrilateral is?
- The time taken to compute the transitive closure of a graph is Theta(n2).

Login to Continue

It will take less than 2 minutes

Report MCQ