An algorithm is made up of two independent time complexities f(n) and — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2023 paper

Module 1: Introduction and Complexity Analysis

20232m

An 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)$

Search Google Ask AI

Similar questions

Design and Analysis of Algorithms An algorithm is made up of two independent time complexities f(n) and g(n). Then the complexities of the algorithm is in the 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)20222m Design & Analysis of AlgorithmsDiscuss the average, worst, and best time complexity of the algorithm. Give suitable examples.20237m Design and Analysis of Algorithms Explain the Prim's algorithm. What is the time complexity of Prim's algorithm?20257m Design & Analysis of AlgorithmsThe complexity of binary search algorithm is: - (i) O(n) - (ii) O(\log n) - (iii) O(n^2) - (iv) O(n \log n)20192m

PreviousLevel order traversal of a rooted tree can be done by starting from root and performing: - (i) Depth first search - (ii) Breadth first search - (iii) Pre-order traversal - (iv) In-order traversal NextWhich of the following standard algorithms is not a greedy algorithm? - (i) Dijkstra's shortest path algorithm - (ii) Kruskal algorithm - (iii) Bellman ford shortest path algorithm - (iv) Prim's algorithm