List of top Data Science Questions on Algorithm Evaluation

Match LIST-I with LIST-II

\[\begin{array}{|c|c|}\hline \textbf{LIST-I (Asymptotic Time Complexity)} & \textbf{LIST-II (Algorithm)} \\ \hline \text{A. Logarithmic  \(O(\log n)\)} & \text{II. Finding an element in a sorted array} \\ \hline \text{B. Quadratic  \(O(n^{2})\)} & \text{III. Bubble sort (worst case)} \\ \hline \text{C. Cubic \(O(n^{3})\)} & \text{IV. Matrix Multiplication} \\ \hline \text{D. Exponential  \(O(2^{n})\)} & \text{I. The Tower of Hanoi problem} \\ \hline \end{array}\]
 

Choose the correct answer from the options given below:

Match LIST-I with LIST-II \[\begin{array}{|c|c|}\hline \text{LIST-I (Evaluate an algorithm's performance)} & \text{LIST-II (Meaning)} \\ \hline \text{A. Completeness} & \text{III. Is the algorithm guaranteed to find a solution when there is one, and to correctly report failure when there is none?} \\ \hline \text{B. Cost optimality} & \text{IV. Does it find a solution with the lowest path cost of all solutions?} \\ \hline \text{C. Time complexity} & \text{I. How long does it take to find a solution? This can be measured in seconds, or more abstractly by the number of states and actions considered.} \\ \hline \text{D. Space complexity} & \text{II. How much memory is needed to perform the operation?} \\ \hline \end{array}\] Choose the correct answer from the options given below: