Big O Notation and Algorithms, File Processing Quiz

What does Big O notation primarily describe?

• The average performance of an algorithm

• The memory usage of an algorithm

• The worst-case time complexity of an algorithm

• The syntax of an algorithm

Which Big O complexity represents constant time?

• O(n)

• O(log n)

• O(1)

• O(n²)

If an algorithm halves the dataset in each iteration, what is its time complexity?

• O(n)

• O(log n)

• O(n²)

• O(1)

In a linear search, if there are 20 elements, how many comparisons are required in the worst case?

• 10

• log₂20

• 20

• 5

What must be true before applying a binary search?

• The data must be random

• The dataset must be small

• The dataset must be sorted

• The dataset must have unique values

Which sorting algorithm swaps adjacent elements if they are in the wrong order?

• Selection sort

• Bubble sort

• Quick sort

• Merge sort

Which sorting method finds the minimum (or maximum) and places it in the correct position each pass?

• Bubble sort

• Selection sort

• Quick sort

• Merge sort

What is the average case complexity of quicksort?

• O(n²)

• O(1)

• O(n log n)

• O(log n)

Which algorithm is more efficient for large datasets?

• Linear search

• Binary search

• Bubble sort

• Selection sort

If the time taken increases four times when input size doubles, what is the likely complexity?

• O(n)

• O(n²)

• O(log n)

• O(1)