recategorized by
285 views
0 votes
0 votes

Consider the following algorithms and their running times :

Algorithms Complexities
(A) Breadth First Search (I) $\theta(v+E)$
(B) Rabin-Karp Algorithm (II) $O(v+E)$
(C) Depth-First Search (III) $\theta((n-m-1) m)$
(D) Heap sort (worst case) (IV) $O\left(n^2\right)$
(E) Quick sort (worst case) (V) $O(n \lg n)$


Which one of the following is correct?

  1. $\text{(A)-(III), (B)-(II), (C)-(I), (D)-(IV), (E)-(V)}$
  2. $\text{(A)-(II), (B)-(III), (C)-(I), (D)-(IV), (E)-(V)}$
  3. $\text{(A)-(II), (B)-(III), (C)-(I), (D)-(V), (E)-(IV)}$
  4. $\text{(A)-(III), (B)-(I), (C)-(II), (D)-(IV), (E)-(V)}$

 

recategorized by

1 Answer

Related questions

0 votes
0 votes
2 answers
2
go_editor asked Nov 20, 2020
973 views
Match $\text{list I}$ with $\text{List II}$$\begin{array}{llll} & \text{List I} && \text{List II} \\ (A) & \text{Topological sort of DAG} & (I) & O(V+E) \\ (B) & \text{Kr...
1 votes
1 votes
0 answers
4
admin asked Oct 23, 2022
897 views
Using $\text{'RSA'}$ algorithm, if $p=13, q=5$ and $e=7$. the value of $d$ and cipher value of $'6'$ with $(e, n)$ key are$7, 4$$7, 1$$7, 46$$55,1$