Lectures (Video)
- 1. Course Introduction
- 2. Developing a Simple Program
- 3. Mechanics of Objects
- 4. Single Pointer Manipulation
- 5. Arrays and Objects
- 6. Growing an Array
- 7. Java Library List Classes
- 8. Object-Oriented Mechanisms
- 9. Interfaces and Abstract Classes
- 10. A Puzzle
- 11. Comparable and Reader
- 12. Various Odds and Ends in Support of Abstracton
- 13. Modularization Facilities in Java
- 14. Access Control (Static Only)
- 15. Integers
- 16. Bit Twiddling - Cost Measures
- 17. Asymptotic Cost
- 18. Merge Sort
- 19. Views - Maps
- 20. Implementing with Arrays
- 21. Arrays - cont
- 22. Introduction to Trees
- 23. Tree Representation and Searching
- 24. Java Support for Generic Programming
- 25. Prority Queues, Range Queries, Java Utilities
- 26. Hashing
- 27. Hashing - Cont.
- 28. Classifications and Sorting
- 29. Sorting - cont.
- 30. Balanced Search Structures
- 31. Balanced Search Structures (cont)
- 32. Pseudo Random Numbers
- 33. Pseudo Random Numbers (cont)
- 34. Game Trees, Minimax
- 35. Threads and Concurrency
- 36. Graphs, Instroduction
- 37. Minimal spanning trees, Union-find
- 38. Dynamic Programming
- 39. Storage Management
- 40. Project Overview
- 41. Storage Management - Project
- 42. Review
Data Structures - Lecture 38
|
Lecture 38 - Dynamic Programming
Prof. Paul Hilfinger
CS 61B Data Structures, Fall 2007 (University of California, Berkeley: Webcast.Berkeley) http://webcast.berkeley.edu Date accessed: 2009-02-07 License: Creative commons BY-NC-ND 2.5 |
Lecture Material
To view the lecture material accompanying this lecture in a new window, please click the button below. If necessary, use the vertical or horizontal scrollbar in the new window to view more of the material or you can resize the window.
To download the above lecture material use this link. (Right-click and select Save Target As or Save Link As.)
