(a) Solve using Recursion Tree method $T(n) = 8T(n/2) + n^2$ (b) Solv…

Question

(a) Solve using Recursion Tree method $T(n) = 8T(n/2) + n^2$

(b) Solve the following recurrence using Master's Theorem Method : $T(n) = 4T\left(\frac{n}{2}\right) + n^2 \sqrt{n}$.

(c) Explain the significance of asymptotic analysis of an algorithm. Discuss various notations used for asymptotic analysis of an algorithm.

Related pages

• Recurrence Relations — topic
• Analysis & Design of Algorithms syllabus