in Algorithms recategorized by
223 views
1 vote
1 vote

Assembly line scheduling and Longest Common Subsequence problems are an example of _______.

  1. Dynamic Programming
  2. Greedy Algorithms
  3. Greedy Algorithms and Dynamic Programming respectively
  4. Dynamic Programming and Branch and Bound respectively
in Algorithms recategorized by
by
223 views

1 Answer

0 votes
0 votes

$\text {option A, both the technique uses dynamic programming concepts.}$

  1. Longest Common Subsequence
  2. Assembly Line Scheduling

 

edited by

2 Comments

Can you explain in simple terms why exactly “dynamic programming” is required for both the problems?
0
0
because both are OPTIMIZATION problems i.e. we are maximizing something or minimizing something.

In assembly line scheduling we want to 'minimize' the cost and assembly line scheduling problem is sister of multi stage garph problem.

In LCS we want maximum length of matching string sequence which is again can only be done effectively by dynamic programming . Remember these type of problems can lead to poor performance if we apply greedy algorithms (as all aspects are not known in greedy because we focus on currently what we have as min/max and we are not taking decisions at every step)
0
0
Answer:

Related questions