Q03

MCQ1 mark, −0.33

Match the algorithms with their time complexities:

\begin{array}{|l|l|}\hline \textbf{Algorithms} & \textbf{Time Complexity} \\\hline \text{P. Tower of Hanoi with $n$ disks} & \text{i. $\Theta (n^2)$} \\\hline \text{Q. Binary Search given $n$ sorted numbers} & \text{ii. $\Theta (n \log n)$} \\\hline \text{R. Heap sort given $n$ numbers at the worst case} & \text{iii. $\Theta (2^n)$} \\\hline \text{S. Addition of two $n\times n$ matrices} & \text{iv. $\Theta (\log n)$} \\\hline \end{array}

(A)

$P\rightarrow (iii) \quad Q \rightarrow(iv) \quad r \rightarrow(i) \quad S \rightarrow(ii)$

(B)

$P\rightarrow (iv) \quad Q \rightarrow(iii) \quad r \rightarrow(i) \quad S\rightarrow(ii)$

(C)

$P\rightarrow (iii) \quad Q \rightarrow(iv) \quad r \rightarrow(ii) \quad S\rightarrow(i)$

(D)

$P\rightarrow (iv) \quad Q \rightarrow(iii)\quad r \rightarrow(ii) \quad S\rightarrow(i)$

Loading…