Test on Comparison of sorting algorithms and time complexity

Question 1: The provided study materials highlight real-time stock trading as a critical application for sorting algorithms.

A. Yes

B. No

Explanation: The study materials state that sorting algorithms are critical for applications such as database management, search engines, graphics rendering, and data analysis. Real-time stock trading is not listed among the applications in the provided text.

Question 2: According to the provided study materials, which statement accurately describes the mechanism of Bubble Sort?

A. It divides the list into smaller sub-lists and then sorts them individually before combining.

B. It repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order, continuing passes until no swaps are needed.

C. It selects a pivot element and partitions the array around it, then recursively sorts the sub-arrays.

D. It finds the smallest element in the unsorted portion and moves it to the beginning of the sorted portion.

Explanation: The study material states that Bubble Sort 'repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, indicating that the list is sorted.'

Question 3: Merge Sort is an example of an algorithm with O(n log n) time complexity.

A. Yes

B. No

Explanation: The study materials describe O(n log n) as 'Linearithmic Time' and list 'Merge Sort' as an example for this complexity.

Question 4: Time complexity quantifies the amount of memory an algorithm requires to run as a function of the length of the input.

A. Yes

B. No

Explanation: Time complexity quantifies the amount of time an algorithm takes to run as a function of the length of the input. The amount of memory an algorithm requires is quantified by space complexity.

Question 5: According to the study materials, what is the primary purpose of Big O notation when analyzing algorithms?

A. To quantify the exact average time an algorithm takes to complete.

B. To provide an asymptotic upper bound on the growth rate of a function, describing the worst-case scenario.

C. To measure the minimum memory space an algorithm requires during execution.

D. To precisely calculate the best-case execution time for any given input size.

Explanation: The study materials state that 'Big O notation provides an asymptotic upper bound on the growth rate of a function' and 'It describes the worst-case scenario or the maximum time an algorithm will take to complete.' Option 1 directly reflects this definition. The other options refer to average time, minimum memory, or best-case time, which are not the primary purposes of Big O notation as described.