If an algorithm has time complexity T(n) = 5n^2 + 3n + 7, its asymptot — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2024 paper

Module 1: Introduction

20242m

If an algorithm has time complexity $T(n) = 5n^2 + 3n + 7$ , its asymptotic upper bound is:
(i) $O(n)$
(ii) $O(n^2)$
(iii) $O(n \log n)$
(iv) $O(n^3)$

Search Google Ask AI

Similar questions

Design & Analysis of AlgorithmsTime complexity of Kadane's Algorithm is: - (i) O(n) - (ii) O(n^2) - (iii) O(n \log n) - (iv) O(n(\log n)^2)20192m Design & Analysis of AlgorithmsAn algorithm is made up of two independent time complexities f(n) and g(n). Then the complexity of the algorithm is in order of: - (i) f(n) \times g(n) - (ii) \max(f(n), g(n)) - (iii) \min(f(n), g(n)) - (iv) f(n) + g(n)20232m Design and Analysis of Algorithms 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)20232m Design & Analysis of AlgorithmsDiscuss the average, worst, and best time complexity of the algorithm. Give suitable examples.20237m

PreviousWhich of the following best describes space complexity? (i) Time taken by the algorithm (ii) Memory required to run an algorithm (iii) Number of recursive calls (iv) Number of loops used NextThe 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)