Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2015 (Mock Test) | Question 10

  • Last Updated : 14 Feb, 2018

The increasing order of following functions in terms of asymptotic complexity is:

\\ f_{1}(n) = n^{0.999999}log (n)\\ f_{2}(n) = 10000000n\\ f_{3}(n) = 1.000001^{n} f_{4}(n) = n^{2}

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

(A) f1(n); f4(n); f2(n); f3(n)
(B) f1(n); f2(n); f3(n); f4(n);
(C) f2(n); f1(n); f4(n); f3(n)
(D) f1(n); f2(n); f4(n); f3(n)

Answer: (D)

Explanation: Source:

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!