6.006 19. Dynamic programming I: Memoization, Fibonacci, Crazy Eigh

Add to Favourites
Post to:

This lecture notes introduces Dynamic programming . The topics covered under this section are 1.Fibonacci Warmup 2.Memoization and subproblems
Shortest Paths 3.Crazy Eights and 4.Guessing Viewpoint. Dynamic programming is a Powerful algorithmic design technique .Large class of seemingly exponential problems have a polynomial solution (“only”) via DP and Particularly for optimization problems (min / max) (e.g., shortest paths).

Instructors: Prof. Erik Demaine, Prof. Ronald Rivest, Prof. Srinivas Devadas, MIT Course Number: 6.006 Level: Undergraduate, 6.006 19. Dynamic programming I: Memoization, Fibonacci, Crazy Eights, Guessing, Introduction to Algorithms, Electrical Engineering and Computer Science, Engineering, Massachusetts Institute of Technology: MIT Open Course Ware, http://ocw.mit.edu (02-11-2011). License: Creative Commons BY-NC-SA: http://ocw.mit.edu/terms/#cc.

Type: pdf

LearnOnline Through OCW

Your Facebook Friends on WizIQ