McqMate

Q. |
## Which case of master’s theorem can be extended further? |

A. | 1 |

B. | 2 |

C. | 3 |

D. | no case can be extended |

Answer» B. 2 | |

Explanation: the second case of master’s theorem can be extended for a case where f(n) |

3.1k

0

Do you find this helpful?

1

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- 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?
- 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?
- Under what case of Master’s theorem will the recurrence relation of binary search fall?
- We can solve any recurrence by using Master’s theorem.
- Which theorem gives the relation between the minimum vertex cover and maximum matching?
- Master’s theorem is used for?
- How many cases are there under Master’s theorem?