Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Aspire Study - Best NIMCET Coaching

🎯 Crack NIMCET with Aspire Study

🔹 India's Most Trusted MCA Coaching
💻 Live + Recorded Classes | 👨‍🏫 Expert Faculty
📝 All India Test Series | 🎯 Personal Mentorship

🥈 NIMCET AIR 2: Ayush Garg

🚀 Join Aspire Now

📂 Aspire Study Library


Question Id : 18857 | Context : UGC NET Computer Science Nov 2021 (Paper II)
 Which of the given options provides the increasing order of asymptotic complexity of functions $f_1,\ f_2,\ f_3$ and $f_4$?

A. $f_1(n)=2^n$

B. $f_2(n)=n^{3/2}$

C. $f_3(n)=n\log n$

D. $f_4(n)=n^{\log n}$

Choose the correct answer from the options given below.


Aspire Study Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

📲
Ask Your Question or Put Your Review.

loading...