edited by
358 views
0 votes
0 votes

The solution that satisfies all constraints of the given problem and either maximizes or minimizes a given objective function is called ________ solution.

  1. greedy
  2. feasible
  3. optimal
  4. ordered
edited by

1 Answer

Related questions

204
views
1 answers
1 votes
gatecse asked Mar 2, 2018
204 views
Let $T_1(n) = O (f(n))$ and $T_2(n) = O (g(n))$, then ${T_1(n)}.{T_2(n)}$ will be$O(f(n).g(n))$ $O(f(n))+O(g(n))$$O(f(n))-O...
205
views
0 answers
0 votes
gatecse asked Mar 2, 2018
205 views
Statement 1 : In greedy method the input stream is divided into two parts.Statement 2 : In greedy method, one input is considered at time for decision makingWhich of the ...
220
views
1 answers
0 votes
gatecse asked Mar 2, 2018
220 views
The running time of an algorithm $T(n)$, where $n$ is the input size, is given by following:$T(n) = \begin{cases} 8T(n/2) + qn & \text{ if } n>1 \\ p & \text{ if } n = 1...
812
views
2 answers
0 votes
gatecse asked Mar 2, 2018
812 views
Bluetooth uses ____ method in physical layer to avoid interference from other devices or other networksFHSSFDSSTDSNone of the above