reshown by
584 views
3 votes
3 votes
Select the wrong statement from the following given options.

a. Dynamic programming is applicable when subproblems are not independent.

b. Divide and conquer algorithm does more work than necessary repeatedly solving the common subproblems

c. Dynamic programming solves each problem exactly once and saves the result into a table.

d. Longest path problem has optimal substructure property.
reshown by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
1
0 votes
0 votes
1 answer
3