3 3 votes Select the wrong statement from the following given options. <ol style="list-style-type:upper-alpha"><li> Dynamic programming is applicable when subproblems are not independent. </li><li> Divide and conquer algorithm does more work than necessary repeatedly solving the common subproblems </li> <li> Dynamic programming solves each problem exactly once and saves the result into a table. </li> <li> Longest path problem has optimal substructure property. </li></ol> Algorithms algorithms test-series dynamic-programming + – junk_mayavi 1.1k views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments Mk Utkarsh commented Jan 10, 2018 reply Follow flag https://www.geeksforgeeks.org/find-longest-path-directed-acyclic-graph/ this one? 0 0 replyShare junk_mayavi commented Jan 10, 2018 reply Follow flag i think i got the solution :) i was thinking about it like shortest path problem. now i got it. thanks 0 0 replyShare Mk Utkarsh commented Jan 10, 2018 reply Follow flag thanks to you too i didn't knew about this problem :p 1 1 replyShare Please log in or register to add a comment.
