NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 30

Question

An algorithm is made up of two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then he order of algorithm is

• A. $max(f(n),g(n))$
• B. $min(f(n),g(n))$
• C. $f(n) + g(n)$
• D. $f(n) \times g(n)$

Answer 1

ANS A

https://gateoverflow.in/231142/%23asymptotic-notations

Answer 2

option A) max(f(n),g(n)) is the answer.

Answer 3

A – SHOULD BE THE ANSWER.