edited by
347 views
0 votes
0 votes

Given the following characteristics :

  1. Optimal substructure
  2. Overlapping subproblems
  3. Memorization
  4. Decrease and conquer

Dynamic programming has the following characteristics :

  1. $\text{(i), (ii), (iv)}$
  2. $\text{(i), (ii), (iii)}$
  3. $\text{(ii), (iii), (iv)}$
  4. $\text{(i), (iii), (iv)}$
edited by

1 Answer

Related questions

1 votes
1 votes
1 answer
1
soujanyareddy13 asked Jan 9, 2022
948 views
Let the predicates $D(x,y)$ mean “team $x$ defeated team $y$” and $P(x,y)$ mean “team $x$ has played team $y$”. The quantified formula for the statement that ther...
0 votes
0 votes
1 answer
2
soujanyareddy13 asked Jan 9, 2022
604 views
The File Transfer Protocol is built on ______________.data centric architectureservice-oriented architectureclient server architectureconnection-oriented architecture
0 votes
0 votes
1 answer
3
soujanyareddy13 asked Jan 9, 2022
529 views
More than one word is put in one cache block to:exploit the temporal locality of reference in a programexploit the spatial locality of reference in a programreduce the mi...
0 votes
0 votes
1 answer
4
soujanyareddy13 asked Jan 9, 2022
446 views
In $\text{DPSK}$ technique, the technique used to encode bits is :$\text{AMI}$Differential codeUnipolar $\text{RZ}$ formatManchester formate