Algorithm Time Complexity Quiz

Which notation is used to represent the upper bound of an algorithm's time complexity?

• Θ (Theta)

• Ω (Omega)

• O (Big-O)

• Σ (Sigma)

Which time complexity represents a constant-time algorithm?

• O(n)

• O(n log n)

• O(1)

• O(n²)

What is the worst-case time complexity of linear search?

• O(n)

• O(n²)

• O(log n)

• O(n log n)

If an algorithm has time complexity O(2ⁿ), how does its execution time grow as input size increases?

• Linearly

• Logarithmically

• Exponentially

• Constant

If a nested loop runs n times in the outer loop and n times in the inner loop, what is the time complexity?

• O(1)

• O(n)

• O(n²)

• O(log n)

Which of the following is the correct way to declare an integer array of size 5 in C++?

• int arr[5];

• array arr[5];

• int arr();

• int arr{};

How do you assign the value 10 to the first element of an array arr in C++?

• arr[0] = 10;

• arr = {10};

• arr[1] == 10;

• arr(0) = 10;

What is the time complexity of finding the maximum element in an unsorted array of size n?

• O(1)

• O(n)

• O(log n)

• O(n²)

Which syntax is used to access the i-th element of an array in C++?

• arr[i]

• arr(i)

• arr{i}

• arr.i

What is the default indexing style of arrays in C++?

• 0-based indexing

• 1-based indexing

• 2-based indexing

• No indexing