🎯 FreeQuizzesFor

Algorithm Complexity Essentials Quiz

Created by: FreeQuizzesFor

Go Back

15 Questions

0 Plays

Algorithm Complexity Essentials: a General level Math quiz. Test your knowledge with 15 questions!

Rate this quiz:

No ratings yet

Questions

Question 1

Which notation is used to describe the upper bound of an algorithm's running time?

A Big X

B Big P

C Big M

D Big O

Question 2

What does 'n' usually represent in algorithm complexity?

A The file name

B The processor speed

C The memory size

D The input size

Question 3

Which complexity class describes an algorithm with constant time?

A O(n log n)

B O(1)

C O(n!)

D O(n^2)

Question 4

What is the worst-case time complexity of a linear search?

A O(n^2)

B O(n)

C O(log n)

D O(1)

Question 5

Which term describes an algorithm that takes longer as input grows?

A Fixed

B Constant

C Static

D Scalable

📋 This quiz has 15 questions in total.