0 votes 0 votes Question - 14 question is what is the approch to solve it by dynamic programming ? Algorithms dynamic-programming + – priyanka gautam-piya asked Dec 15, 2016 edited Jun 21, 2022 by makhdoom ghaya priyanka gautam-piya 2.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes answer is B rahul rocker answered Dec 16, 2016 rahul rocker comment Share Follow See all 2 Comments See all 2 2 Comments reply priyanka gautam-piya commented Dec 16, 2016 reply Follow Share yes it ans is b but question is how you approach for dynamic programming ? 0 votes 0 votes rahul rocker commented Dec 17, 2016 reply Follow Share For dynamic programming we required three thing 1)Recursive Eqn 2)optimal substructure 3)overlapping subproblem Recursive Eqn is like this TS[i,s]= min{cost(i,j)+TS(j,s-{j})} if s ≠0 (i,1) if s=⊘ 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes answer will be B . but for dynamic approach you can watch this video. Rajesh Raj answered Dec 16, 2016 Rajesh Raj comment Share Follow See all 0 reply Please log in or register to add a comment.