What is the complexity of T(n) = 2T(n/4) + n^2 \log n? (i) \Theta(n^2 — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2023 paper

Module 1: Introduction

20232m

What is the complexity of $T(n) = 2T(n/4) + n^2 \log n$ ?
(i) $\Theta(n^2 \log(\log n))$
(ii) $\Theta(n^3 \log n)$
(iii) $\Theta(n^2 \log n)$
(iv) $\Theta(n \log n)$

Search Google Ask AI

Similar questions

Design and Analysis of Algorithms Apply the Master Theorem to determine the time complexity of the following recurrence relations. (i) T(n) = 4T(n/2) + n^3 (ii) T(n) = T(n/2) + 2^n20235m Design and Analysis of Algorithms The recurrence T(n) = T(n/2) + 1 has a time complexity of: (i) O(n) (ii) O(\log n) (iii) O(n \log n) (iv) O(n^2)20242m Design & Analysis of AlgorithmsState Master's theorem and find the time complexity for the following recurrence: T(n) = 2T(n^{1/2}) + \log n20237m Design and Analysis of Algorithms State master's theorem and find the time complexity for the following recurrence: T(n) = 2T(n^{1/2}) + \log n20227m

PreviousWhich sorting algorithm is considered stable and has a time complexity of O(n^2)? (i) Quick sort (ii) Merge sort (iii) Insertion sort (iv) Selection sort NextIn algorithm analysis, what does "space complexity" refer to? (i) The number of input elements (ii) The amount of physical memory used (iii) The number of recursive calls (iv) The number of lines of code in the algorithm