MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Master s Theorem Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Under what case of Master s theorem will the recurrence relation of binary search fall? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | It cannot be solved using master s theorem |
| Answer» C. 3 | |
| 2. |
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? |
| A. | T(n) = O(nlog<sub>b</sub>a) |
| B. | T(n) = O(n<sup>c</sup> log n) |
| C. | T(n)= O(n<sup>c</sup> (log n)<sup>k+1</sup> |
| D. | T(n) = O(n<sup>2</sup>) |
| Answer» D. T(n) = O(n<sup>2</sup>) | |
| 3. |
Which case of master s theorem can be extended further? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | No case can be extended |
| Answer» C. 3 | |
| 4. |
Under what case of Master s theorem will the recurrence relation of stooge sort fall? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | It cannot be solved using master s theorem |
| Answer» B. 2 | |
| 5. |
Under what case of Master s theorem will the recurrence relation of merge sort fall? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | It cannot be solved using master s theorem |
| Answer» C. 3 | |
| 6. |
We can solve any recurrence by using Master s theorem. |
| A. | true |
| B. | false |
| Answer» C. | |
| 7. |
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? |
| A. | T(n) = O(nlog<sub>b</sub>a) |
| B. | T(n) = O(n<sup>c</sup> log n) |
| C. | T(n) = O(f(n)) |
| D. | T(n) = O(n<sup>2</sup>) |
| Answer» D. T(n) = O(n<sup>2</sup>) | |
| 8. |
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? |
| A. | T(n) = O(nlog<sub>b</sub>a) |
| B. | T(n) = O(n<sup>c</sup> log n) |
| C. | T(n) = O(f(n)) |
| D. | T(n) = O(n<sup>2</sup>) |
| Answer» C. T(n) = O(f(n)) | |
| 9. |
What is the result of the recurrences which fall under first case of Master s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc? |
| A. | T(n) = O(n^log<sub>b</sub>a) |
| B. | T(n) = O(n<sup>c</sup> log n) |
| C. | T(n) = O(f(n)) |
| D. | T(n) = O(n<sup>2</sup>) |
| Answer» B. T(n) = O(n<sup>c</sup> log n) | |
| 10. |
How many cases are there under Master s theorem? |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» C. 4 | |
| 11. |
Master s theorem is used for? |
| A. | solving recurrences |
| B. | solving iterative relations |
| C. | analysing loops |
| D. | calculating the time complexity of any code |
| Answer» B. solving iterative relations | |