Asymptomatic Efficiency

Asymptomatic Efficiency

University

9 Qs

quiz-placeholder

Similar activities

HEAP TREE

HEAP TREE

University

11 Qs

DSA - 2a

DSA - 2a

University

8 Qs

Алгоритмы

Алгоритмы

University

14 Qs

BCSC0006 Trees

BCSC0006 Trees

University

10 Qs

Hashing

Hashing

University

10 Qs

KMP Pattern Matching

KMP Pattern Matching

University

10 Qs

Algorithms and algorithmic Complexity

Algorithms and algorithmic Complexity

University

10 Qs

Data Structures - Training: Quiz 1

Data Structures - Training: Quiz 1

University

11 Qs

Asymptomatic Efficiency

Asymptomatic Efficiency

Assessment

Quiz

Computers

University

Medium

Created by

Ricky Granados

Used 3+ times

FREE Resource

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

8.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

True or False O(n^3) is the boundary of O(n^2)

True

False

9.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

What is the time complexity of the function shown in the image?

O(1)

O(nlog(n))

O(n^2)

O(n^3)