Search Header Logo

Asymptomatic Efficiency

Authored by Ricky Granados

Computers

University

Used 4+ times

Asymptomatic Efficiency
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

9 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is the SLOWEST time complexity?

O(1)

O(2^n)

O(n!)

O(n^4)

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is the FASTEST time complexity?

O(1)

O(n)

O(nlog(n))

O(2^n)

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

O(n^3 + 52n^2 + 17n + 8) belongs to what time complexity?

O(n^4)

O(n^3)

O(n^2)

O(n)

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is the FASTEST time complexity?

O(n)

O(n^4)

O(nlog(n))

O(log(n))

5.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Media Image

What time complexity is demonstrated by the graph?

O(n+ n)

O(n)

O(2n^2)

O(1)

6.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

What would be the time complexity of the function in the picture?

O(log n)
O(n)

O(n^3)

O(n^2)

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

True or False, O(1) is an ELEMENT of O(n^2)

True

False

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?