OpenCourse: Programming Abstractions / Stanford
2009年9月1日
「Programming Abstractions」コースはスタンフォード大学が公開している講座です。「Programming Methodology」コースの上級版にあたります。C++言語を用いて、再帰的呼び出し、解析アルゴリズム、抽象化、スタックやキューなどの基本的なデータ構造などを学習します。
コースの詳しい内容やハンドアウトなどの関連資料は、「Stanford School of Engineering - Stanford Engineering Everywhere」のページから参照できます。
Lecture 1 | Programming Abstractions - YouTubeAbout the CS106 Series at Stanford
Lecture 2 | Programming Abstractions - YouTubeSimilarity between C++ & Java: - syntax - variable types - operators - control structures
Lecture 3 | Programming Abstractions - YouTubeC++ Libraries - Standard Libraries
Lecture 4 | Programming Abstractions - YouTubeC++ Console I/O, C++ File I/O, Stream Operations
Lecture 5 | Programming Abstractions - YouTubeClient Use of Templates, Vector Class, Vector Client Interface
Lecture 6 | Programming Abstractions - YouTubeMore Containers, Map Class, Uses of Map, Map Client Interface
Lecture 7 | Programming Abstractions - YouTubeSeeing Functions as Data: Specific Plot Functions, Generic Plot Function, Back to the Set
Lecture 8 | Programming Abstractions - YouTubeCommon Mistakes Stumbled Upon: 'I'terator, Common Mistakes Stumbled Upon: Concatenating Strings, Solving Problems Recursively, Functional Recursion
Lecture 9 | Programming Abstractions - YouTubeThinking Recursively, Procedural vs Functional - Recursion, Fractal Code
Lecture 10 | Programming Abstractions - YouTubeRefresh: Permute Code, Tree of Recursive Calls
Lecture 11 | Programming Abstractions - YouTubeBacktracking Pseudocode, Sudoku Solver, Sudoku Code, Cryptarithmetic, Dumb Solver, Smarter Solver, Looking for Patterns
Lecture 12 | Programming Abstractions - YouTubePointer Movie, Pointer Operations: Code & Pointer Memory Diagrams, Pointer Basics, Pointer and Dynamic Arrays, Use of Pointers
Lecture 13 | Programming Abstractions - YouTubeCoding with Linked List, Printing the List, Using Recursion to Print List, De-allocating the Memory Used for the Linked List
Lecture 14 | Programming Abstractions - YouTubeAlgorithm Analysis, Evaluating the Performance, Analysis of Codes: Statement Counts
Lecture 15 | Programming Abstractions - YouTubeSelection Sort, Live Demo: Working/execution of the Code, Selection Sort Analysis, Insertion Sort Algorithm
Lecture 16 | Programming Abstractions - YouTubePartitioning for Quicksort, Quicksort Code Working/execution, Quicksort Code
Lecture 17 | Programming Abstractions - YouTubeSort Template with Callback, Supplying the Callback Function, One Last Convenience: Default Callback Function, Why Object Oriented Programming
Lecture 18 | Programming Abstractions - YouTubeAbstract Data Types, Wall of Abstraction, Why ADTs?
Lecture 19 | Programming Abstractions - YouTubeRules of Template Implementation, Explanation of the Working, Not Allow Member Wise Copy, InsertAt Function
Lecture 20 | Programming Abstractions - YouTubeLive 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
Lecture 21 | Programming Abstractions - YouTubeBuffer: Vector vs Stack, Buffer as Linked List, Cursor Design, Use of Dummy Cell, Linked List Insert/delete, Linked List Cursor Movement
Lecture 22 | Programming Abstractions - YouTubeMap as Vector, A different Strategy: Binary Search Tree, Trees in General, Binary Search Tree for Numbers, Operating on Trees, Tree Traversals at Work
Lecture 23 | Programming Abstractions - YouTubePathfinder Demo, Graphs: Examples, Graphs: Explanation, Implementation Strategies, Graph Representation in C++, Nodes and Arcs in C++, Graph Traversals
Lecture 24 | Programming Abstractions - YouTubeCompare Map Implementations, Hashtable Idea, Hash Functions, Hash Collisions
Lecture 25 | Programming Abstractions - YouTubeLexicon Case Study, Lexicon as Sorted Vector, Lexicon as BST, Lexicon as Hash Table, Summary so Far, Noticing Patterns/repetitions in the Words
Lecture 26 | Programming Abstractions - YouTubeFinal Showdown, Thinking About Design, Runtime Performance, Memory Used, Code Complexity, Making Tradeoffs, Array vs Vector, Stack/Queue vs Vector
Lecture 27 | Programming Abstractions - YouTubeGuest Lecturer: Keith Schwarz, About the C++ Language, Quick History of C++, C++ Philosophy, C++ Without genlib.h, A Working genlib.h Replacement
関連記事 on Publickey
タグ ： OpenCourse
≫次の記事
OpenCourse: Programming Methodology / Stanford
≪前の記事
OpenCourse: Programming Paradigms / Stanford
Junichi Niino（jniino）
