- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- We can solve any recurrence by using Mas...

Q. |
## We can solve any recurrence by using Master’s theorem. |

A. | true |

B. | false |

Answer» B. false | |

Explanation: no we cannot solve all the recurrences by only using master’s theorem. we can solve only those which fall under the three cases prescribed in the theorem. |

View all MCQs in:
Design and Analysis of Algorithms

- What is the result of the recurrences which fall under second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?
- What is the result of the recurrences which fall under third case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?
- Under what case of Master’s theorem will the recurrence relation of merge sort fall?
- Under what case of Master’s theorem will the recurrence relation of stooge sort fall?
- What is the result of the recurrences which fall under the extended second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc(log n)k?
- Under what case of Master’s theorem will the recurrence relation of binary search fall?
- Which of the following recurrence relations can be used to find the nth fibonacci number?
- What will be the recurrence relation of the code of recursive selection sort?
- Recurrence equation formed for the tower of hanoi problem is given by
- 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?

Login to Continue

It will take less than 2 minutes

Report MCQ