Quiz on Complexity Measures

Which notation represents the worst-case time complexity of an algorithm?

• A. Big O (O)

• B. Big Omega (Ω)

• C. Big Theta (Θ)

• D. Little o (o)

Which notation represents both the upper and lower bounds of an algorithm's time complexity?

• A. Big O (O)

• B. Big Omega (Ω)

• C. Big Theta (Θ)

• D. Little omega (ω)

What two pieces of information allow you to analyse an algorithm?

• Time Complexity
• Space Complexity
• Size Complexity
• Complex Complexity
• Simplicity Complex

Which notation is used to describe the average-case time complexity of an algorithm?

• A. Big O (O)

• B. Big Omega (Ω)

• C. Big Theta (Θ)

• D. Little omega (ω)

Which Asymptotic notation is used to represent a Strict Upper bound time complexity

• Big Oh

• Small Oh

• Omega

• Small Omega

If for an algorithm time complexity is given by O(1) then the complexity of it is ____________

• Constant

• Polynomial

• Exponential

• None of the mentioned

What is the time complexity of following code:

for i in range(1, n, 5):

print(i)

• A. O(1)

• B. O(n)

• C. O(n^2)

• D. O(log n)

What is the time complexity of following code:

int a = 0, b = 0

for i in range(N):

a += i

for j in range(M):

b += j

• •O(N * M) time,

• •O(N + M) time,

• None of these

What is the time complexity of following code:

int a = 309, b = 322

int c = a + b

print(c)

• O(log n)

• O(n)

• O(1)

• None of these

What is the time complexity of an algorithm that iterates through an input list with two nested loops?

• A. O(1)

• B. O(n)

• C. O(n^2)

• D. O(log n)