🎯 FreeQuizzesFor

Algorithm Efficiency Basics Quiz

Created by: FreeQuizzesFor

Go Back

15 Questions

0 Plays

Algorithm Efficiency Basics: a General level Math quiz. Test your knowledge with 15 questions!

Rate this quiz:

No ratings yet

Questions

Question 1

What does Big O notation primarily measure?

A Pixel resolution

B Software bug count

C Time complexity

D Hardware cost

Question 2

Which complexity class represents the fastest growth?

A O(n!)

B O(n)

C O(n^2)

D O(log n)

Question 3

What is the complexity of searching an item in a sorted list via binary search?

A O(log n)

B O(n^2)

C O(n)

D O(1)

Question 4

What is the best case time complexity of a simple linear search?

A O(log n)

B O(n)

C O(n^2)

D O(1)

Question 5

Which notation describes the upper bound of an algorithm?

A Big Omega

B Small o

C Big O

D Big Theta

📋 This quiz has 15 questions in total.