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

M

Mr. Dubey • 52.26K Points
Coach

Q. 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

(A) f(n) x g(n)

(B) max ( f(n),g(n))

(C) min (f(n),g(n))

(D) f(n) + g(n)

Correct : Option (B)

Share

Discusssion

Login to discuss.

Related MCQs

Q. Which of the following is the other name of the output stage in an amplifier?

Q. The output Y of a 2-bit comparator is logic 1 whenever the 2-bit input A is greater than the 2-bit input B. The number of combinations for which the o

Q. The graph of current gain versus collector-current indicates that the current gain ?

Q. Is 0011 valid region code / outcode used in Line Clipping algorithm?

Q. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called

Q. __________ steps are required to perform rotation about arbitary point.

Q. For transformation from the Cartesian coordinate system to Spherical coordinate system, ap should be equal to ____________.

Q. What is the simplified form of the Boolean expression T= (X+Y)(X+Y’)(X’+Y) ?

Q. When the dielectric is homogeneous,the potential gradient is

Q. The main utility of SCR is due to