arrow
arrow
arrow
Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4? A. f1(n) = 2ⁿ B. f2(n) = n3/2
Question



Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?
A. f1(n) = 2ⁿ
B. f2(n) = n3/2
C. f3(n) = n log n
D. f4(n) = nlog n
Choose the correct answer from the options given below:

A.

(C), (B), (D), (A)

B.

(C), (B), (A), (D)

C.

(B), (C), (A), (D)

D.

(B), (C), (D), (A)

Correct option is A


To order the functions by increasing asymptotic complexity, let's analyze their growth rates:




test-prime-package

Access ‘UGC NET Computer Science’ Mock Tests with

  • 60000+ Mocks and Previous Year Papers
  • Unlimited Re-Attempts
  • Personalised Report Card
  • 500% Refund on Final Selection
  • Largest Community
students-icon
198k+ students have already unlocked exclusive benefits with Test Prime!

Free Tests

Free
Must Attempt

Communication

languageIcon English
  • pdpQsnIcon10 Questions
  • pdpsheetsIcon20 Marks
  • timerIcon12 Mins
languageIcon English
Free
Must Attempt

Food Science, Properties and Quality Test

languageIcon English
  • pdpQsnIcon10 Questions
  • pdpsheetsIcon20 Marks
  • timerIcon12 Mins
languageIcon English
Free
Must Attempt

भू-आकृतिक स्थलरूप

languageIcon English
  • pdpQsnIcon10 Questions
  • pdpsheetsIcon20 Marks
  • timerIcon12 Mins
languageIcon English