中文名: 斯坦福大学开放课程: 抽象编程
英文名: 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.
