By Julie Zelenski
To listen to an audio podcast, mouse over the title and click Play. Open iTunes to download and subscribe to podcasts.
This course is the natural successor to Programming Methodology and covers such advanced programming topics as recursion, algorithmic analysis, and data abstraction using the C++ programming language, which is similar to both C and Java. If you've taken the Computer Science AP exam and done well (scored 4 or 5) or earned a good grade in a college course, Programming Abstractions may be an appropriate course for you to start with, but often Programming Abstractions (Accelerated) is a better choice. Programming Abstractions assumes that you already have familiarity with good programming style and software engineering issues (at the level of Programming Methodology), and that you can use this understanding as a foundation on which to tackle new topics in programming and data abstraction. Topics: Abstraction and its relation to programming. Software engineering principles of data abstraction and modularity. Object-oriented programming, fundamental data structures (such as stacks, queues, sets) and data-directed design. Recursion and recursive data structures (linked lists, trees, graphs). Introduction to time and space complexity analysis. Uses the programming language C++ covering its basic facilities.
|1||Video1. Programming Abstractions Lecture 1||Julie Zelenski gives an introduction to the course, recursion, algorithms, dynamic data structures and data abstraction; she also introduced the significance of programming and gives her opinion of what makes 106B "great;" C++ is introduced, too.||7/23/2008||Free||View in iTunes|
|2||Video2. Programming Abstractions Lecture 2||Julie describes the similarities between C++ and Java, which include general syntax, primitive variable types, operators and control structures; she proceeds to go through the code of a basic C++ program and explains each individual piece of code.||7/23/2008||Free||View in iTunes|
|3||Video3. Programming Abstractions Lecture 3||Julie goes over C++ libraries and explains what they are and how they are useful. She continues to introduce C++ basics, including strings, various operators on strings and comparing two strings.||7/23/2008||Free||View in iTunes|
|4||Video4. Programming Abstractions Lecture 4||Julie continues to cover the console input/output in C++ and discusses the file I/O and changing between an old style string to a C++ string format. She also begins to go over stream operations and their basic use as well as object oriented programming.||7/23/2008||Free||View in iTunes|
|5||Video5. Programming Abstractions Lecture 5||Julie discusses the use of templates, vectors and template specialization. She then goes through an example of code line by line explaining each part in detail. Finally, she goes on to explain what grid interfaces are.||7/23/2008||Free||View in iTunes|
|6||Video6. Programming Abstractions Lecture 6||In the sixth lecture, Julie discusses sequential containers, associative containers, map classes/interfaces, iteration over maps and set classes. She explains why set classes are different and sometimes better to use.||7/23/2008||Free||View in iTunes|
|7||Video7. Programming Abstractions Lecture 7||Julie explains the idea of functions as data and specific plot functions and continues onto client feedback functions and ADTs. She then delves into recursion and solving problems using recursion.||7/23/2008||Free||View in iTunes|
|8||Video8. Programming Abstractions Lecture 8||Julie talks about solving problems recursively. She covers functional recursion with the simple example of writing an exponential function using recursion.||7/23/2008||Free||View in iTunes|
|9||Video9. Programming Abstractions Lecture 9||Julie goes over recursion and the proper ways to solve problems recursively. She continues with the example of a program that draws a fractal image and explains a Mandarin code to illustrate the different possibilities of drawing different pictures.||8/11/2008||Free||View in iTunes|
|10||Video10. Programming Abstractions Lecture 10||Julie explains procedural recursion and introduces permute code. She goes through another example of recursive code line by line, explaining each component. Recursive backtracking and it's usefulness are discussed.||7/23/2008||Free||View in iTunes|
|11||Video11. Programming Abstractions Lecture 11||Julie continues with recursive backtracking and introduces pointers and recursive data. Following, she focuses on solving the problems rather than the exact code and later uses the example of a program that will solve a Sudoku puzzle.||7/23/2008||Free||View in iTunes|
|12||Video12. Programming Abstractions Lecture 12||Julie continues to go over pointers and moves on to recursive data and linked lists. She explains the basics of pointers with two variables pointing to the same address.||7/23/2008||Free||View in iTunes|
|13||Video13. Programming Abstractions Lecture 13||Julie introduces linked lists and continues to discuss recursive data. She goes line by line through an example code she writes during the lecture. She then inserts variables in an order; she uses the example of an address book to explain this.||7/23/2008||Free||View in iTunes|
|14||Video14. Programming Abstractions Lecture 14||Julie starts off with algorithm analysis, the big-O notation and introduces sorting. She begins off with a brief overview of what algorithm analysis is and how to utilize it. Later, she continues to go through recursive algorithms and their uses.||7/23/2008||Free||View in iTunes|
|15||Video15. Programming Abstractions Lecture 15||Julie continues to cover sorting. She begins with an example of a selection sorting code and a graphic demo of the code in progress. Thereafter, she explains the different methods available to sort different kinds of data.||7/23/2008||Free||View in iTunes|
|16||Video16. Programming Abstractions Lecture 16||Julie continues with sorting, specifically quadratic and linearithmic sorting methods, and then explains how to reasonably partition data sets for quicksort. Thereafter, she proceeds to go over different functional templates for sorting algorithms.||7/23/2008||Free||View in iTunes|
|17||Video17. Programming Abstractions Lecture 17||Julie continues to go over sort templates and callback functions, then shows a final version of the sort template, one that will be extremely useful in the next homework assignment.||7/23/2008||Free||View in iTunes|
|18||Video18. Programming Abstractions Lecture 18||Julie introduces the 'implement vector' and discusses ADTs (abstract data types) in more detail. She then develops a Vector from the ground up, explaining each step as she goes.||7/23/2008||Free||View in iTunes|
|19||Video19. Programming Abstractions Lecture 19||Julie reiterates the rules for template implementers and continues by coding live with the class explaining each line of code in detail after writing it. Throughout the process of writing the code, she encounters several errors and has to debug it.||7/23/2008||Free||View in iTunes|
|20||Video20. Programming Abstractions Lecture 20||Julie continues discussing Vector and moves on to stack and queue, covering chapter ten in the course textbook. She goes over several rules for templates again to reinforce how important they are.||7/23/2008||Free||View in iTunes|
|21||Video21. Programming Abstractions Lecture 21||Julie talks about the buffer version of vector vs. stack and follows this with an example of cursor design. She also talks about linked list insertion and deletion. Cursor movement is the next topic covered.||7/23/2008||Free||View in iTunes|
|22||Video22. Programming Abstractions Lecture 22||Julie discusses map as a vector and describes a different, possibly better, strategy. The basics of trees and their usefulness and how they can be used with binary search is then introduced.||7/23/2008||Free||View in iTunes|
|23||Video23. Programming Abstractions Lecture 23||Julie shows a YouTube video of Barack Obama answering a question about what kind of sorting algorithm he would use to sort a list of data. She also gives several examples of problems that are capable of being solved with sorting.||7/23/2008||Free||View in iTunes|
|24||Video24. Programming Abstractions Lecture 24||Julie introduces hashing and it's uses in search and retrieval; map implementations and the different kinds of search algorithms are then discussed. Thereafter she explains that logarithmic searches are relatively fast and often finish the search.||7/23/2008||Free||View in iTunes|
|25||Video25. Programming Abstractions Lecture 25||Julie examines a case study and opening up the lexicon file, which is complicated; she walks the students through the code and explains why she wrote it as she did as opposed to a sorted vector or binary search tree.||7/23/2008||Free||View in iTunes|
|26||Video26. Programming Abstractions Lecture 26||Julie ties up the "loose ends" of the course: after a general review of the concepts covered in the course, she asks which of two examples is the better. She then covers manipulation of dynamic data structures (lists, trees, graphs).||7/23/2008||Free||View in iTunes|
|27||Video27. Programming Abstractions Lecture 27||In the final lecture, Keith talks about the C++ programming language. He starts of with C++ history, C++ without CS 106 and what comes next.||7/23/2008||Free||View in iTunes|
This is definitely an excellent class to learn. But the resolution of the videos is very low. It is really hard for me to recognize what is actually displayed on the screen. It'll be great if you guys can provide PDF files of the slides just like the iPhone course here in iTunes U.
Very interesting course and the lecturer is great! Thank you Stanford and iTunesU
Are you serious? Are you trying to say that people should learn from this kind of videos? It is already 21th century, make it HD, I can see nothing in that video! Or at least provide people pdfs or something. I could expect that from a cheap university from middle-east but not from Stanford!