中文名: 斯坦福大學開放課程: 抽象編程
英文名: Open Stanford Course : Programming Abstractions
資源格式: WMV
學校: Stanford
斯坦福大學
主講人: Julie Zelenski
版本: 開放式課程 更新完畢
發行日期: 2008年
地區: 美國
對白語言: 英語
文字語言: 英文
簡介:

資源更新說明:
這個帖子本來包括 計算機軟件學習系列3個課程資源
Introduction to Computer Science
Programming Methodology CS106A
Programming Abstractions CS106B
Programming Paradigms CS107
在教育頻道上線後 為了開放課程類資源更加規范 方便網友查找 現把這個系列分開發布
該資源為 Programming Abstractions CS106B部分 請已經下載過的朋友注意下 以免重復下載 給大家帶來不便 抱歉!

簡介:
斯坦福大學的“Stanford Engineering Everywhere ”免費提供學校裡最受歡迎的工科課程，給全世界的學生和教育工作者。
得益於這個項目，我們有機會和全世界站在同一個數量級的知識起跑線上。
本課程系列內容來源於斯坦福大學的“Stanford Engineering Everywhere ”項目。
官網地址： http://see.stanford.edu/default.aspx
Introduction to Computer Science系列課程簡介：
Programming Abstractions 抽象編程 CS106B
本課程是銜接編程方法論課程，並展示高級編程主題，如遞歸、算法分析、C++編程語言的數據抽象化，C++類似於C和JAVA語言。如果已經通過電腦科學AP測試並獲得高分（4或5分），或者是在大學課程中取得高分，就可以從抽象化編程開始。 抽象化編程假定你已熟悉良好的編程風和軟件工程內容(編程方法學的程度)。並能以編程和數據抽象化作為基礎來掌握新主題。
主題：抽象和編程的關系。 數據的軟件工程原則的抽象和模塊化。 面向對象編程，基本數據結構，如堆棧（隊列，集）和數據導向設計。 遞歸和遞歸數據結構（鏈表，樹，圖）。 引入時間和空間復雜度分析。
基礎要求:編程方法學基礎、以面向高級編程主題。同程度的編程課程（包括高職的AP課程）可以取代我們的編程方法學課程。
Introduction to Computer Science | Programming Abstractions –CS106B
his 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.
主講 Julie Zelenski

I left my rural hometown of Stevinson, CA (population: 262) to come to Stanford as a wide-eyed freshman in 1985. That tour passed through SLE, the LSJUMB, a half-dozen changes in my major, and I emerged with a Mathematical Sciences degree. A few years out in the "real world" were enough to send me running back for grad school in computer science and I segued into my current position as a lecturer in 1992 without setting foot off campus again. I teach courses in the undergrad systems curriculum, including programming methodology and abstractions, language paradigms, compilers, and object-oriented design and development, but I especially enjoy working with the section leaders in the CS106 courses. I have been the advisor to the Stanford SWE and ACM-W chapters and recently served on the Computer Science Advanced Placement development committee.

目錄:
Programming Abstractions CS106B-lecture01
Programming Abstractions CS106B-lecture02
Programming Abstractions CS106B-lecture03
Programming Abstractions CS106B-lecture04
.....................
Programming Abstractions CS106B-lecture27

資源來自網絡收集 未經過一一的質量 安全等檢測
只是把收集的資源和各位驢友分享 僅作網絡學習交流使用 請勿用於商業用途 !
希望各位下載的驢友能多多參與分流保源