- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- How many cases are there under Master’s ...

Q. |
## How many cases are there under Master’s theorem? |

A. | 2 |

B. | 3 |

C. | 4 |

D. | 5 |

Answer» B. 3 | |

Explanation: there are primarily 3 cases under master’s theorem. we can solve any recurrence that falls under any one of these three cases. |

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?
- Master’s theorem is used for?
- We can solve any recurrence by using Master’s theorem.
- Which case of master’s theorem can be extended further?
- Which theorem gives the relation between the minimum vertex cover and maximum matching?

Login to Continue

It will take less than 2 minutes

Report MCQ