Quiz 1 (Time and Space Complexity)

What is the time complexity of the following code?

• O(n)

• O(n²)

• O(n log n)

• O(log n)

What is the space complexity of a recursive function that uses a stack for its operations?

• O(n²)

• O(n)

• O(1)

• O(log n)

In Big O notation, which of the following represents a linear relationship?

• O(1)

• O(n²)

• O(n)

• O(n log n)

What is the best-case time complexity of a binary search algorithm?

• O(1)

• O(log n)

• O(n)

• O(n log n)

In Big O notation, which of the following represents a logarithmic relationship?

• O(n²)

• O(n)

• O(n log n)

• O(log n)

Which of the following functions have a time complexity better than O(n²)?

• O(n log n)

• O(n!)

• O(2^n)

• None of the above

What is the space complexity of the following code?

• O(1)

• O(log n)

• O(n)

• O(n²)

What is the space complexity of an iterative algorithm that uses a constant amount of space?

• O(n²)

• O(log n)

• O(n)

• O(1)

What is the time complexity of linear search in the worst case?

• O(1)

• O(log n)

• O(n)

• O(n²)

Which of the following statements are true about time complexity?

• Best case gives the minimum time required

• Worst case gives the maximum time required

• Average case considers random inputs

• Time complexity always depends on compiler speed