About
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.
Prerequisites: *Solid performance in Programming Methodology and readiness to move on to advanced programming topics. *A comparable introductory programming course (including high school AP courses) is often a reasonable substitute for our Programming Methodology.
Course Homepage: [[http://see.stanford.edu/see/courseInfo.aspx?coll=11f4f422-5670-4b4c-889c-008262e09e4e]]
Course features at Stanford Engineering Everywhere page: *Programming Abstractions *Lectures *Syllabus *Handouts *Assignments *Exams
Videos

Lecture 17: Sort Template with Callback
Nov 15, 2010
·
2285 views

Lecture 8: Common Mistakes Stumbled Upon: 'I'terator
Nov 15, 2010
·
2936 views

Lecture 1: About the CS106 Series at Stanford
Nov 15, 2010
·
10807 views

Lecture 26: Final Showdown
Nov 15, 2010
·
2047 views

Lecture 25: Lexicon Case Study
Nov 15, 2010
·
2314 views

Lecture 10: Refresh: Permute Code
Nov 15, 2010
·
2660 views

Lecture 18: Abstract Data Types
Nov 15, 2010
·
2440 views

Lecture 12: Pointer Movie
Nov 15, 2010
·
2688 views

Lecture 4: C++ Console I/O
Nov 15, 2010
·
4204 views

Lecture 27: C++ Programming Language
Nov 15, 2010
·
29777 views

Lecture 7: Seeing Functions as Data: Specific Plot Functions
Nov 15, 2010
·
2720 views

Lecture 15: Selection Sort
Nov 15, 2010
·
2891 views

Lecture 2: Similarity between C++ & Java: - syntax - variable types - operators ...
Nov 15, 2010
·
6518 views

Lecture 13: Coding with Linked List
Nov 15, 2010
·
4878 views

Lecture 24: Compare Map Implementations
Nov 15, 2010
·
2333 views

Lecture 22: Map as Vector
Nov 15, 2010
·
2149 views

Lecture 3: C++ Libraries - Standard Libraries
Nov 15, 2010
·
6525 views

Lecture 6: More Containers
Nov 15, 2010
·
2564 views

Lecture 5: Client Use of Templates
Nov 15, 2010
·
2891 views

Lecture 19: Rules of Template Implementation
Nov 15, 2010
·
2181 views

Lecture 21: Buffer: Vector vs Stack
Nov 15, 2010
·
2583 views

Lecture 11: Backtracking Pseudocode
Nov 15, 2010
·
3618 views

Lecture 23: Pathfinder Demo
Nov 15, 2010
·
2343 views

Lecture 14: Algorithm Analysis
Nov 15, 2010
·
5645 views

Lecture 16: Partitioning for Quicksort
Nov 15, 2010
·
2385 views

Lecture 9: Thinking Recursively
Nov 15, 2010
·
3282 views

Lecture 20: Live Coding: Recap of the Vector-based Implementation for Stack
Sep 1, 2010
·
2517 views