Explore topic-wise MCQs in Master s Theorem Multiple Choice.

This section includes 7 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.

Solve the following recurrence using Master s theorem.T(n) = 4T (n/4) + n log n

A. T(n) = O(n (log n)<sup>2</sup>)
B. T(n) = O(n log n)
C. T(n) = O(n<sup>2</sup>log n)
D. cannot be solved using master s theorem
Answer» B. T(n) = O(n log n)
Discussion
2.

Solve the following recurrence using Master s theorem.T(n) = 4 T (n/2) + n!

A. T(n) = O(n!)
B. T(n) = O(n! log n)
C. T(n) = O(n<sup>2</sup>log n)
D. cannot be solved using master s theorem
Answer» B. T(n) = O(n! log n)
Discussion
3.

Solve the following recurrence using Master s theorem.T(n) = 0.7 T (n/2) + 1/n

A. T(n) = O(n)
B. T(n) = O(log n)
C. T(n) = O(n<sup>2</sup>log n)
D. cannot be solved using master s theorem
Answer» E.
Discussion
4.

Solve the following recurrence using Master s theorem.T(n) = 2T (n/2) + n/ log n

A. T(n) = O(n)
B. T(n) = O(log n)
C. T(n) = O(n<sup>2</sup>log n)
D. cannot be solved using master s theorem
Answer» E.
Discussion
5.

Solve the following recurrence using Master s theorem.T(n) = 16T (n/4) + n

A. T(n) = O(n)
B. T(n) = O(log n)
C. T(n) = O(n<sup>2</sup>log n)
D. T(n) = O(n<sup>2</sup>)
Answer» E.
Discussion
6.

Solve the following recurrence using Master s theorem.T(n) = T (n/2) + 2n

A. T(n) = O(n<sup>2</sup>)
B. T(n) = O(n<sup>2</sup> log n)
C. T(n) = O(2<sup>n</sup>)
D. cannot be solved
Answer» D. cannot be solved
Discussion
7.

Solve the following recurrence using Master s theorem.T(n) = 4T (n/2) + n2

A. T(n) = O(n)
B. T(n) = O(log n)
C. T(n) = O(n<sup>2</sup>log n)
D. T(n) = O(n<sup>2</sup>)
Answer» D. T(n) = O(n<sup>2</sup>)
Discussion