🎯 FreeQuizzesFor

Algorithmic Complexity Basics Quiz

Created by: FreeQuizzesFor

Go Back

14 Questions

0 Plays

Algorithmic Complexity Basics: a General level Math quiz. Test your knowledge with 14 questions!

Rate this quiz:

No ratings yet

Questions

Question 1

What is the Big O notation for constant time complexity?

A O(1)

B O(n^2)

C O(log n)

D O(n)

Question 2

Which complexity represents a linear growth?

A O(n)

B O(1)

C O(n!)

D O(log n)

Question 3

Which complexity is faster than linear time?

A O(log n)

B O(2^n)

C O(n)

D O(n^2)

Question 4

What does O(n^2) generally indicate?

A Constant time

B Logarithmic time

C Linear time

D Quadratic time

Question 5

Which of these is the most efficient?

A O(n)

B O(n log n)

C O(n^2)

D O(1)

📋 This quiz has 14 questions in total.