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.

9. Programming Abstractions Lecture 9

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.

10. Programming Abstractions Lecture 10

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.

11. Programming Abstractions Lecture 11

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.

12. Programming Abstractions Lecture 12

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.

13. Programming Abstractions Lecture 13

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.

14. Programming Abstractions Lecture 14

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.

15. Programming Abstractions Lecture 15

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.

16. Programming Abstractions Lecture 16

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.

17. Programming Abstractions Lecture 17

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.

18. Programming Abstractions Lecture 18

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.

19. Programming Abstractions Lecture 19

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.

20. Programming Abstractions Lecture 20

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.

21. Programming Abstractions Lecture 21

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.

22. Programming Abstractions Lecture 22

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.

23. Programming Abstractions Lecture 23

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.

24. Programming Abstractions Lecture 24

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.

25. Programming Abstractions Lecture 25

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).

26. Programming Abstractions Lecture 26

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.

27. Programming Abstractions Lecture 27

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.

1. Programming Abstractions Lecture 1

These courses are fantastic for self learning but the video leave a lot to the imagination due to it poor quality. 
Next time please pipe the display feed line out instead of bootlegging the video steam.
Plus the pdf files included can not be highlighted  or have notes annotations.

Great info, only wish I could view it clearly.

Very interesting course and the lecturer is great! Thank you Stanford and iTunesU

Great course!!

Programming Abstractions

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.

2. Programming Abstractions Lecture 2

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.

3. Programming Abstractions Lecture 3

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.

4. Programming Abstractions Lecture 4

The best podcast episodes about true crime. For any thrill seeking podcast listeners who just can't get enough of the captivating stories of murderers and criminals. This topic has all the best episodes from many different true crime podcasts.  Add episodes you're interested into your queue below!

Best True Crime Podcasts

The best self improvement podcast episodes. From improving productivity, to finding purpose in your life to what constitutes freedom, this topic is on anything and everything that can help people to improve their lives. Add episodes you're interested into your queue below!