Course: Course | Programming Abstractions Dnatube
share this page with the world.
Lec 1 - Programming Abstractions (Stanford)
"Lec 1 - Programming Abstractions (Stanford)" The first lecture by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 2 - Programming Abstractions (Stanford)
"Lec 2 - Programming Abstractions (Stanford)" Lecture two by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 3 - Programming Abstractions (Stanford)
"Lec 3 - Programming Abstractions (Stanford)" Lecture 3 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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 and takes special note that...
Lec 4 - Programming Abstractions (Stanford)
"Lec 4 - Programming Abstractions (Stanford)" Lecture 4 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 5 - Programming Abstractions (Stanford)
"Lec 5 - Programming Abstractions (Stanford)" Lecture 5 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. In the fifth lecture, 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...
Lec 6 - Programming Abstractions (Stanford)
"Lec 6 - Programming Abstractions (Stanford)" Lecture 6 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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....
Lec 7 - Programming Abstractions (Stanford)
"Lec 7 - Programming Abstractions (Stanford)" Lecture 7 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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. Complete Playlist for...
Lec 8 - Programming Abstractions (Stanford)
"Lec 8 - Programming Abstractions (Stanford)" Lecture 8 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie talks about solving problems recursively. She covers functional recursion with the simple example of writing an exponential function using recursion. From the simple program performing as an exponential function Julie...
Lec 9 - Programming Abstractions (Stanford)
"Lec 9 - Programming Abstractions (Stanford)" Lecture 9 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 10 - Programming Abstractions (Stanford)
"Lec 10 - Programming Abstractions (Stanford)" Lecture 10 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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. The...
Lec 11 - Programming Abstractions (Stanford)
"Lec 11 - Programming Abstractions (Stanford)" Lecture 11 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 12 - Programming Abstractions (Stanford)
"Lec 12 - Programming Abstractions (Stanford)" Lecture 12 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie continues to go over pointers and moves on to recursive data and linked lists. She starts off explaining the basics of pointers and have two variables pointing to the same address then explains that it is better to...
Lec 13 - Programming Abstractions (Stanford)
"Lec 13 - Programming Abstractions (Stanford)" Lecture 13 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 14 - Programming Abstractions (Stanford)
"Lec 14 - Programming Abstractions (Stanford)" Lecture 14 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 15 - Programming Abstractions (Stanford)
"Lec 15 - Programming Abstractions (Stanford)" Lecture 15 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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;...
Lec 16 - Programming Abstractions (Stanford)
"Lec 16 - Programming Abstractions (Stanford)" Lecture 16 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 17 - Programming Abstractions (Stanford)
"Lec 17 - Programming Abstractions (Stanford)" Lecture 17 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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. She also goes over class implementation...
Lec 18 - Programming Abstractions (Stanford)
"Lec 18 - Programming Abstractions (Stanford)" Lecture 18 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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. Complete Playlist for the Course:...
Lec 19 - Programming Abstractions (Stanford)
"Lec 19 - Programming Abstractions (Stanford)" Lecture 19 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 20 - Programming Abstractions (Stanford)
"Lec 20 - Programming Abstractions (Stanford)" Lecture 20 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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. Complete Playlist for...
Lec 21 - Programming Abstractions (Stanford)
"Lec 21 - Programming Abstractions (Stanford)" Lecture 21 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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; she illustrates...
Lec 22 - Programming Abstractions (Stanford)
"Lec 22 - Programming Abstractions (Stanford)" Lecture 22 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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. Complete Playlist for the...
Lec 23 - Programming Abstractions (Stanford)
"Lec 23 - Programming Abstractions (Stanford)" Lecture 23 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 24 - Programming Abstractions (Stanford)
"Lec 24 - Programming Abstractions (Stanford)" Lecture 24 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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...
Lec 25 - Programming Abstractions (Stanford)
"Lec 25 - Programming Abstractions (Stanford)" Lecture 25 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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. She...
Lec 26 - Programming Abstractions (Stanford)
"Lec 26 - Programming Abstractions (Stanford)" Lecture 26 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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,...
Lec 27 - Programming Abstractions (Stanford)
"Lec 27 - Programming Abstractions (Stanford)" Lecture 27 by Keith (for Julie Zelenski)--a section leader and the instructor of CS 106L--for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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. Complete Playlist...
Course | Programming Abstractions
Source of these courses is stanford
This course (CS 106B) is the successor to CS 106A and covers more advanced programming topics such as recursion, algorithmic analysis, and data abstraction. It is taught using the C++ programming language, which is similar to both C and Java. In the past when both CS 106A and CS106B were taught in C/C++, the coupling between the two classes was very tight and it was unheard for students to take CS106B without having completed our CS 106A (we recommended CS 106X instead).
stanford Website: http://www.dnatube.com/school/stanford
COURSE NAME: Course | Programming Abstractions