edited by
2,368 views
0 votes
0 votes

Match the following with respect to algorithm paradigms :

$\begin{array}{clcl}  & \textbf{List-I} & {} & \textbf{List-II} \\ \text{(a)} & \text{The 8-Queen's problem} & \text{(i)} & \text{Dynamic programming}  \\ \text{(b)} & \text{Single-Source shortest paths} & \text{(ii)} & \text{Divide and Conquer} \\ \text{(c)} & \text{STRASSEN's Matrix multiplication} & \text{(iii)} & \text{Greedy approach} \\ \text{(d)}& \text{Optimal Binary search trees} & \text{(iv)} & \text{Back tracking} \\  \end{array}$

$\textbf{Code :}$

  1. $\text{(a)-(iv), (b)-(i), (c)-(iii), (d)-(ii)}$
  2. $\text{(a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)}$
  3. $\text{(a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)}$
  4. $\text{(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)}$
edited by

1 Answer

0 votes
0 votes

Option D

8 queens = Backtracking
Strassens mat mul = Divide n conquer
Single src = Greedy approach

Related questions

0 votes
0 votes
4 answers
1
Pooja Khatri asked Jul 13, 2018
2,127 views
The solution of the recurrence relation $T(m) = T(3m/4)+1$ is$\Theta (\lg \: m)$$\Theta (m)$$\Theta (m\lg m)$$\Theta (\lg\lg m)$
0 votes
0 votes
2 answers
2
Pooja Khatri asked Jul 13, 2018
1,980 views
Consider a Boolean function of 'n' variables. The order of an algorithm that determines whether the Boolean function produces a output 1 isLogarithmicLinearQuadraticExpon...
1 votes
1 votes
2 answers
3
Pooja Khatri asked Jul 13, 2018
2,655 views
The definitions in an XML document are said to be ______ when the tagging system ans definitions in the DTD are all in compliancewell-formedreasonablevalidlogical