DS Quizz

What is the time complexity of Binary Search in the worst case?

• O(n)

• O(log n)

• O(n log n)

• O(n^2)

Which of the following is a stable sorting algorithm?

• Quick Sort

• Merge Sort

• Heap Sort

• Selection Sort

In which case does Linear Search outperform Binary Search?

• When the array is sorted

• When the array has duplicate elements

• When the array is small and unsorted

• When the array is large and sorted

Which of the following is true about the time complexity of Selection Sort?

• It is O(n) in the worst case.

• It is O(n log n) in the best case.

• It is O(n^2) in both the worst and best cases.

• It is O(log n) in the worst case.

Consider the following pseudocode:

for i = 1 to n:

for j = 1 to i:

print(i, j)

• O(n)

• O(n log n)

• O(n^2)

• O(n^3)

Consider the following pseudocode:

for i = 0 to n-1:

minIndex = i

for j = i+1 to n:

if arr[j] < arr[minIndex]:

minIndex = j

swap arr[i] with arr[minIndex]

What is the time complexity of this algorithm?

• A) O(n)

• B) O(n log n)

• C) O(n^2)

• D) O(n^3)

Consider the following pseudocode:

for i = 1 to n:

for j = 1 to n:

for k = 1 to n:

print(i, j, k)

What is the time complexity of this algorithm?

• O(n)
  
  
  

• O(n^2)

• O(n^3)

• O(n log n)

i = n

while i > 0:

print(i)

i = i / 2

What is the time complexity of this algorithm?

• A) O(n)
  

• B) O(log n)
  

• C) O(n log n)
  

• D) O(1)

sum = 0

for i = 1 to n:

sum = sum + arr[i]

What is the time complexity of this algorithm?

• A) O(log n)
  

• B) O(n)
  

• C) O(n^2)
  

• D) O(1)

i = 1

while i < n:

if arr[i] == target:

return i

i = i * 2

What is the time complexity of this algorithm?

• A) O(log n)
  

• B) O(n)
  

• C) O(n log n)
  

• D) O(1)