Lectures (Video)
- 1. Introduction to Course
- 2. Basics of C++
- 3. C++ Libraries
- 4. File IO, OO Features
- 5. Vector, Grid, Stack, Queue Classes
- 6. Map Class
- 7. Plot Functions and Abstract Data Types
- 8. Recursion
- 9. Fractal Code
- 10. Permute and Subset Code
- 11. Sudoku Code
- 12. Pointers
- 13. Linked List
- 14. Algorithm Analysis
- 15. Sorting
- 16. Quicksort
- 17. Callback, OO Programming
- 18. Abstract Data Types
- 19. Template Implementation
- 20. Live Coding
- 21. Buffer
- 22. Binary Search Tree
- 23. Graphs
- 24. Hashing
- 25. Lexicon Case Study
- 26. Runtime Performance
- 27. Guest Lecturer
Programming Abstractions - Lecture 20
|
Get the Flash Player to view video.
Lecture 20 - Live Coding
Live Coding: Recap of the Vector-based Implementation for Stack, Linked List Implementation for Stack, Live Coding: Linked List Implementation for Stack, Analyzing Push/pop Functions, Queue Implementation, Live Coding: Queue Implementation, Alternative Implementation, Text Editor Case Study, Buffered Class Interface and Buffer Layered on Vector, Live Coding: Text Editor, Evaluate Vector Buffer, Buffer Layered on Stack, Live Demo, Compare Implementations, Buffer as Linked List
Julie Zelenski
CS106B Programming Abstractions (Stanford University: Stanford Engineering Everywhere) http://see.stanford.edu Date accessed: 2008-12-04 License: Creative Commons Attribution 3.0 |
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.)
Supplementary lecture material is listed below.1. Queue code
2. Stack code
