Big O Quiz: Test Your Understanding

What is the time complexity of inserting a new element at the beginning of a linked list?

• a) O(1)
  

• b) O(log n)

• c) O(n)

• d) O(n log n)

15. Consider the following Java code snippet:

      for (int i = 0; i < n; i++) { // Do something in constant time

}

for (int i = 0; i < n; i++) {

  for (int j = 0; j < i; j++) { // Do something in constant time

  }

}

   

What is the time complexity of this code?

• a) O(n)
  

• b) O(n^2)

• c) O(n log n)

• d) O(n^3)

What is the time complexity of finding the median of an unsorted array?

• a) O(1)

• b) O(n)

• c) O(n log n)

• d) O(n^2)

What is the time complexity of finding the mode of a sorted array?

• a) O(1)

• b) O(n)

• c) O(n log n)

• d) O(n^2)

What is the time complexity of sorting an array using quick sort in the worst case?

• a) O(n)

• b) O(n log n)

• c) O(n^2)

• d) O(n^3)

What is the time complexity of sorting an array using heap sort?

• a) O(n)

• b) O(n log n)

• c) O(n^2)

• d) O(n^3)

What is the time complexity of the remove(index) operation in an ArrayList?

• A. O(n)

• B. O(1)

• C. O(log n)

• D. O(n^2)

What is the time complexity of the addFirst(element) operation in a doubly linked list?

• A. O(n)

• B. O(1)

• C. O(log n)

• D. O(n^2)

What is the time complexity of sorting an array using bubble sort?

• a) O(1)

• b) O(n)

• c) O(n^2)

• d) O(n log n)

What does Big O notation represent?

• a) The exact number of operations a program performs.

• b) The worst-case time complexity of an algorithm.

• c) The average time complexity of an algorithm.

• d) The best-case time complexity of an algorithm.