Algorithm Time Complexity Quiz

What is the time complexity of a linear search algorithm?

• O(n)

• O(log n)

• O(n log n)

• O(1)

Which asymptotic notation gives the upper bound of an algorithm's time complexity?

• Big-O

• Big-Ω

• Big-Θ

• None

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

• O(n)

• O(log n)

• O(n log n)

• O(1)

Which algorithm has a time complexity of O(n^2)?

• Bubble sort

• Selection sort

• Insertion sort

• All of the above

What is the best-case time complexity of a heap sort algorithm?

• O(n)

• O(log n)

• O(n log n)

• O(1)

Which data structure is used in a heap sort algorithm?

• Array

• Linked list

• Stack

• Queue

What is the time complexity of a naive string-matching algorithm?

• O(n)

• O(n^2)

• O(n log n)

• O(1)

Which algorithm is used for finding a pattern in a text?

• Rabin-Karp algorithm

• Knuth-Morris-Pratt algorithm

• Naive string-matching algorithm

• All of the above

What is the time complexity of a binary search algorithm in the average case?

• O(n)

• O(log n)

• O(n log n)

• O(1)

Which asymptotic notation gives the lower bound of an algorithm's time complexity?

• Big-O

• Big-Ω

• Big-Θ

• None