Test on Sorting and searching algorithms

Question 1: Algorithms exhibiting O(2ⁿ) time complexity are generally impractical for even moderately sized inputs.

A. Yes

B. No

Explanation: The study materials state that for O(2ⁿ) exponential time complexity, 'These algorithms are typically impractical for even moderately sized inputs.'

Question 2: Time complexity primarily measures the exact execution time of an algorithm in seconds.

A. Yes

B. No

Explanation: Time complexity does not measure the exact execution time in seconds. Instead, it measures how the number of operations an algorithm performs grows as a function of the length of its input.

Question 3: According to the provided study materials, which of the following is an example of an algorithm that exhibits O(1) (constant time) complexity?

A. Accessing an element in an array by its index

B. Performing a Binary Search

C. Iterating through all elements in a list once

D. Executing a Bubble Sort

Explanation: O(1) (Constant Time) means the algorithm takes the same amount of time regardless of the input size. The study materials specifically state that 'Accessing an element in an array by its index' is an example of O(1) complexity. Binary Search is O(log n), iterating through all elements in a list once is O(n), and Bubble Sort is O(n²).

Question 4: According to the study materials, why is the worst-case scenario often considered when analyzing an algorithm's time complexity?

A. To provide an upper bound on the algorithm's performance.

B. To measure the exact execution time in seconds.

C. To understand how an algorithm will perform under the most challenging conditions.

D. To classify algorithms according to how their space requirements grow.

Explanation: The study materials state that the worst-case scenario "provides an upper bound on the algorithm's performance" and "helps in understanding how an algorithm will perform under the most challenging conditions." Measuring exact execution time is explicitly stated as not the purpose of time complexity analysis. Classifying algorithms by space requirements is related to Big O but not the primary reason for considering the worst-case time scenario specifically.

Question 5: Bubble Sort compares elements located at the beginning and end of the list in each step to determine their order.

A. Yes

B. No

Explanation: Bubble Sort compares adjacent elements, not elements at the beginning and end of the list.