Computer Science: Algorithms & Complexity Quiz

Created by: FreeQuizzesFor

Go Back
15 Questions
0 Plays
Computer Science: Algorithms & Complexity: a General level Math quiz. Test your knowledge with 15 questions!
Rate this quiz:
No ratings yet

Questions

Question 1
What notation represents algorithmic complexity?
A Big O
B Big P
C Big X
D Big M
Question 2
Which is the fastest complexity class?
A O(1)
B O(n)
C O(n^2)
D O(2^n)
Question 3
What does 'n' usually represent in complexity?
A CPU speed
B Memory cost
C Input size
D Pixel count
Question 4
Which complexity is considered exponential?
A O(2^n)
B O(log n)
C O(n log n)
D O(n)
Question 5
What is O(n^2) called?
A Linear
B Quadratic
C Logarithmic
D Constant

๐Ÿ“‹ This quiz has 15 questions in total.

Log in to see all questions and correct answers!

๐Ÿšจ Report An Error