Here I am going to explain about 0/1 Knapsack problem using dynamic programming. We already know about what is knapsack problem? in greedy approach.The main concept in both the approach is same that is we must select the item and fill it into sack (just like a bag) in such a way that we get more profit.In greedy approach...

Multistage Graph ProblemThis problem is solve by using dynamic programming method. Multistage Graph is a directed weighted graph. All vertices are divided into stages in such a way that vertex are connected to one edge to another edge.Note first stage and last stage are represented as a single vertex from...

 Dynamic ProgrammingLet we discuss about dynamic programming.Dynamic programming is an optimisation technique and we know Greedy method is also an optimisation  technique but both follow different strategy for solving the problem.We know optimisation problem are those which gives either minimum results or maximum...