1 votes 1 votes Assembly line scheduling and Longest Common Subsequence problems are an example of _______. Dynamic Programming Greedy Algorithms Greedy Algorithms and Dynamic Programming respectively Dynamic Programming and Branch and Bound respectively Algorithms nielit-sta-2020 algorithms dynamic-programming + – gatecse asked Dec 9, 2020 • recategorized Jul 5, 2022 by Lakshman Bhaiya gatecse 742 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes $\text {option A, both the technique uses dynamic programming concepts.}$ Longest Common Subsequence Assembly Line Scheduling Hira Thakur answered Dec 11, 2020 • edited Mar 7, 2021 by Hira Thakur Hira Thakur comment Share Follow See all 2 Comments See all 2 2 Comments reply gatecse commented Mar 7, 2021 reply Follow Share Can you explain in simple terms why exactly “dynamic programming” is required for both the problems? 0 votes 0 votes Asim Siddiqui 4 commented Mar 20, 2021 reply Follow Share 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 votes 0 votes Please log in or register to add a comment.
