6.12: Debugging,Knapsack Problem,Introduction to DynamicProgramming

Description
In this lecture initial part we will be discussing about Debugging. Later we will be discussing about optimization. optimization is a process of getting max out put with min input or with out increasing the input or with the same input. There are several examples for optimization problem such as Travelling sales man problem, Shortest path problem and Knapasack problem and lastly we will be learning about Dynamic integer programming.

"Prof. Eric Grimson& Prof. John Guttag, 6.12: Debugging, Knapsack Problem, Introduction to Dynamic Programming 6.00 Introduction to Computer Science and Programming, Massachusetts Institute of Technology: MIT OpenCourseWare),http://ocw.mit.edu (30-07-2011). License: Creative Commons BY-NC-SA: http://ocw.mit.edu/terms/#cc"