Understanding Big O Notation and Algorithm Complexity

What is the time complexity of adding an item to an array list?

• O(1)

• O(log n)

• O(n)

• O(n^2)

In a worst-case scenario, what is the time complexity of a linear search?

• O(log n)

• O(n)

• O(1)

• O(n^2)

What advantage does a sorted array provide when searching for an item?

• It reduces space complexity.

• It enables a binary search.

• It increases the time complexity.

• It allows for a linear search.

What is the time complexity of operations like pushing and popping in stacks?

• O(n^2)

• O(n)

• O(1)

• O(log n)

How is the time complexity of searching in a hash table generally described?

• O(n^2)

• O(n)

• O(log n)

• O(1)

What is the time complexity of inserting an item into a binary tree?

• O(1)

• O(log n)

• O(n)

• O(n^2)

Which sorting algorithm has a quadratic time complexity?

• Quick Sort

• Merge Sort

• Bubble Sort

• Heap Sort

What is the space complexity of the merge sort algorithm?

• O(n)

• O(1)

• O(log n)

• O(n^2)

Which notation describes the average case scenario of an algorithm?

• Big O

• Big Theta

• Little o

• Big Omega

What does Big Omega notation represent?

• Worst case scenario

• Average case scenario

• Best case scenario

• Space complexity