http://vdisk.weibo.com/s/1bUGd/1321792858

1. 计算机学科规范 CS2013
—— 系统能力的培养
抛砖引玉研讨稿

2. Survey of CC2001/CS2008 Usage
• Developed survey to gather data for CS2013
– Reviews usage of CC2001 and CS2008
– Rating of importance of existing knowledge areas
– Rating of principles (e.g., importance of stylized classes)
– Suggestions for new topics of import/knowledge areas
• Survey released in December, 2010
– ~1500 US department chairs/directors of UG education
– ~2000 International department chairs
– Received 201 responses

3. Importance of Topics

4. Suggested Topics (% of
Suggestions)

5. Bounding Size of Curriculum
CC2001 CS2008 CS2013
Tier 1 Tier 2
AL. Algorithms and Complexity 31 31 20 8
AR. Architecture and Organization 36 36 0 16
CN. Computational Science 0 0 1 0
DS. Discrete Structures 43 43 38 3
GV. Graphics and Visual Computing 3 3 2 1
HC. Human-Computer Interaction 8 8 4 4
IAS. Security and Information Assurance 0 0 2 6
IM. Information Management 10 11 5 5
IS. Intelligent Systems 10 10 0 10
NC. Networking and Communication 15 15 10 0
OS. Operating Systems 18 18 4 11
PBD. Platform-based Development 0 0 0 0
PD. Parallel and Distributed Computing 0 0 5.5 8.5
PL. Programming Languages 21 21 8 20
SDF. Software Development Fundamentals 38 47 41 0
SE. Software Engineering 31 31 5 19
SF. System Fundamentals 0 0 21 9
SP. Social and Professional Issues 16 16 6 10
TOTAL 280 290 172.5 130.5
Tier1 + 100% Tier2: 303
Tier1 + 90% Tier2: 290
Tier1 + 80% Tier2: 277

6. Body of Knowledge Update (1)
• Addition of new Knowledge Areas
– Parallel and Distributed Computing
• Most important area to add as indicated by previous feedback
• Will include additional core hours
– Information Assurance and Security
• Second most important area to add
• Will include additional core hours
– Systems Fundamentals
• Cross-cutting systems concepts
– E.g., caching, locality, latency, parallelism
• Avoid tying these to any one topic (e.g. Operating Systems,
Architecture) to foster broader thinking and new pedagogy
– Platform-based Development
• E.g., web, mobile devices, game consoles, robots, etc.

7. Body of Knowledge Update (2)
• Reorganization of topics in many Knowledge Areas
– Net-Centric Computing  Networking and Communications
• Sharpen focus on networking
• Web development moves to “Platform-based Development”
– Notably, includes a reworking of topics in Programming
Fundamentals, Programming Languages, and Algorithms
• Move paradigm-specific concepts (e.g., OOP, Functional) to
Programming Languages
• Programming Fundamentals + some Software Engineering = “Software
Development Fundamentals”
• Seek to broaden thinking away from equating “Programming
Fundamentals” with “Introductory Programming Courses”
– Introductory programming course includes:
platform + language/paradigm + software development

8. CMU 计算机本科教学
CMU Computer Science Core:
15-122 Principles of Imperative Computation
15-150 Principles of Functional Programming
15-210 Parallel and Sequential Data Structures and Algorithms
15-213 Introduction to Computer Systems
15-251 Great Theoretical Ideas in Computer Science
15-451 Algorithm Design and Analysis

9. CMU 计算机本科教学
One Algorithms & Complexity elective:
15-354 Computational Discrete Mathematics
15-355 Modern Computer Algebra
15-453 Formal Languages and Automata
21-301 Combinatorics
21-484 Graph Theory

10. CMU 计算机本科教学
One Applications elective:
05-391 Designing Human-Centered Software
05-431 Software Structures for User Interfaces
10-601 Machine Learning
11-411 Natural Language Processing
15-313 Foundations of Software Engineering
15-322/15-323 Intro to Computer Music
15-381 Artificial Intelligence: Representation and Problem Solving
15-384 Robotic Manipulation
15-385 Computer Vision
15-415 Database Applications
15-462 Computer Graphics

11. CMU 计算机本科教学
One Logics and Languages elective:
15-312 Foundations of Programming Languages
15-317 Constructive Logic
15-414 Bug Catching: Automated Program Verification and
Testing
21-300 Basic Logic
80-311 Computability and Incompleteness

12. CMU 计算机本科教学
One Software Systems elective:
15-410 Operating System Design and Implementation
15-411 Compiler Design
15-418 Parallel Computer Architecture and Programming
15-440 Distributed Systems
15-441 Computer Networks

13. 计算机系统基础
• 1998 年在 CMU 开设
• 2002 年正式出版教材
• 2010 年第 2 版发行
• 涵盖了计算机系统领域的
广泛内容
• 但仅从程序员的角度介绍
，不与后续课程抢内容

14. 计算机系统基础
• 汇编
– 二进制，汇编， link/loader
• 组成与体系结构
– 流水线，超标量， memory hierarchy
• 操作系统
– Fork/execve/wait/signal (shell), 虚存
• I/O 与网络编程
– I/O, 网络程序设计 , 并发程序设计

15. 计算机系统基础
• 可接触的概念、做中学
• 设计了 8 个 labs
1. Bit operation
2. Bombing (tracker)
3. Buffer overflow attack (hacker)
4. Pipeline design (using HCL)
5. Code optimization
6. Shell
7. Malloc
8. Proxy

16. Great Theoretical Ideas in Computer Science
• How to use theoretical ideas to
– formulate and solve problems in computer science
• Integrate
– mathematical material with general problem solving
techniques
– and computer science applications
• Examples are drawn from
– Algorithms, Complexity Theory, Automata Theory,
– Game Theory, Probability Theory, Graph Theory,
– Algebra, Cryptography, and Combinatorics
• Assignments involve
– both mathematical proofs and programming

17. Great Theoretical Ideas in Computer Science
• Number
– Pancakes with a Problem!
– Choose Your Representation!
– Unary, Binary, and Beyond
– One Step at a Time: Induction
– On Raising a Number to a Power
– Euclid's Great Recursive Algorithm for GCD
– Fibonacci Numbers: An Unexpected Formula
– Modular Arithmetic and the RSA Cryptosystem

18. Great Theoretical Ideas in Computer Science
• Counting:
– Counting I: One To One Correspondence and Choice
Tree Representation
– Counting II: Recurring Problems and Correspondences
– Counting III: Polynomials Count! Pascal's Triangle

19. Great Theoretical Ideas in Computer Science
• Computation:
– The One Minute to Learn Programming Language:
Finite Automata
– Playing Symbol Games: Logic, Language, and Meaning
– On Time versus Input Size
– Problem Solving: The Method behind the AHA!
– Grade School Revisited: How to Add and Multiply
– Grade School Again: A Parallel Perspective

20. Great Theoretical Ideas in Computer Science
• Probability Methods
– Probability I: Counting in Terms of Proportions
– Probability II: Probability Pitfalls and Paradoxes
– Counting, Naming, and Worst-Case Compression
– Dating Theory: Who Wins the Battle of the Sexes?
– Probability III: Random Variables and Great
Expectations!
– Probability IV: Event Space in an Infinite Choice Tree
– Probability V: Random Walks.

21. Great Theoretical Ideas in Computer Science
• Computational Theory
– Thales's Legacy: What is a Proof?
– Cantor's Legacy: Infinity and Diagonalization.
– Turing's Legacy: The Limits of Computation
– Godel's Legacy: The Limits of the Symbol Game
– Ancient Paradoxes with an Incompressible Resolution

22. M
I
T
的
核
心
课
程

23. 计算机系统工程
• 互联网成为主流以及多核的出现
• 如何控制计算机系统的设计复杂性
– Strong modularity using client-service design
– Naming
– Virtualization
• 其它系统设计的主要问题
– Performance
– Networks
– Fault Tolerance
– Atomicity and Consistency
– Security
• 2011 年开始授课

24. 计算机系统工程
• 大量的经典论文阅读
2. Worse is Better
3. A Fast File System for UNIX
4. The X Window System
5. The Evolution of an x86 Virtual Machine Monitor
6. End-to-end Arguments in System Design
7. MapReduce
8. The Design and Implementation of a Log-Structured
File System
9. RAID: A Case for Redundant Arrays of Inexpensive
Disks
10.Hints of Computer System Design

25. 计算机系统工程
• 设计类 project
– tagged file system
– 设计类 google-doc 系统
• Lab
– The UNIX File System (practice file system related
commands)
– The UNIX Time-Sharing System (practice other
shell commands)
– Internet Routes and Measuring Round Trip Times
(traceroute)
– MapReduce

26. Stanford 计算机本科核心课程
Systems
cs106B Programming Abstractions
cs107 Computer Organization and Systems
Computer Systems: A Programmer‘s Perspective by Bryant and
O’Hallaron(CMU) . C Programming Language by Kernighan
cs110 Principles of Computer Systems
课本： Principles of Computer System Design by Jerome
H. Saltzer and M. Frans Kaashoek (MIT)
Theory
cs103 Mathematical Foundations of Computing
cs109 Intro to Probability for Computer Scientists
cs161 Data Structures and Algorithms

27. Berkeley 计算机本科核心课程
Core
CS 61A Structure and Interpretation of Computer Programs
CS61B Data Structures
CS61C Machine Structures
EECS42 Digital Electronics
Upper Division Required
CS 170 Algorithms
CS 162 Operating systems

28. Berkeley 计算机本科核心课程
Breadth courses choose two from the following:
CS 150 Digital Systems
CS 152 Computer Architecture
CS 160 User Interfaces
CS 161 Computer Security
CS 164 Languages and Compilers
CS 169 Software Engineering
CS 184 Computer Graphics
CS 186 Databases
CS 188 Artificial Intelligence

29. Utexas 的《计算机系统概念》
• Yale Patt ， Introduction to Computing
Systems: from bits and gates to C and beyond.
• 美国计算机界的卓越泰斗，与 Knuth 齐名

30. • UIUC 、 Utexas 、 UMN 、 UMASS 、上
海交大、中科大等采用
• Patt 教授 2011 年中科大授课的 Youku 视频
– http://www.youku.com/playlist_show/id_6525373.html
（密码 ustc ）
• 英文 ( 授课时使用 , 随时更新 )
– http://acsa.ustc.edu.cn/htmls/ics-courses/en/index.html
• 大一就对计算机系统软件和硬件有整体的
理解

31. 《计算机系统概念》目录
• 第 1 章 欢迎阅读本书
1.1 我们的目标
1.2 怎么才能做到
1.3 两个反复出现的理念
1.4 计算机系统简述
1.5 两个非常重要的思想
1.6 计算机：通用计算设备
1.7 从问题描述到电子运转
1.8 习题

32. • 第 2 章 bit 、数据类型及其运算
第 3 章 数字逻辑
第 4 章 冯 · 诺伊曼模型
第 5 章 LC-3 结构
第 6 章 编程
第 7 章 汇编语言
第 8 章 输入 / 输出
第 9 章 TRAP 程序和子程序
第 10 章 栈

33. • 第 11 章 C 语言编程概述
第 12 章 变量和运算符
第 13 章 控制结构
第 14 章 函数
第 15 章 测试与调试技术
第 16 章 指针和数组
第 17 章 递归
笫 18 章 C 语言中的 I/O
第 19 章 数据结构

34. Programming in C++

35. Programming in C++
• Introduction
– Computers, People, and Programming
• Programming and “Hello, Word!”
• Objects, Types, and Values
• Computation
• Errors
• Writing a Program
• Completing a Program
• Technicalities: Functions, etc
• Technicalities: Classes, etc

36. Programming in C++
• Input/Output Streams
• Customizing I/O
• A Display Model
• Graphics Classes
• Graphics Class Design
• Graphing Functions and Data
• Graphical User Interfaces

37. Programming in C++
• Vector and Free Store
• Vectors and Arrays
• Vector, Template, and Exceptions
• Containers and Iterators
• Algorithms and Maps

38. Programming in C++
• 每周一次 lab 指导
• 3 个 projects
– 分数计算
– 字符界面游戏（ Fox-hounds ）
– 图形界面游戏
• 国内传统教学方法
– 以语言为主
– 课程结束后学生基本不会编程（有基础的除外）
– 基本上要在数据结构之后才会编程

39. 实验和考试
• Marking on the curve
• 开卷考试、考卷上网
– 美国学生靠阅读学习
– 中国学生靠做题学习
• 实验
– 每门课的实验占总成绩的 30% ～ 50%
– 基本以个人完成为主
• 与国际上通常以小组为单位不同
– 必须有防止抄袭的手段
• 定期变化实验内容
• 其它手段

40. 助教
• 基础课每 20 名学生一名助教
– 作业 , labs, projects, 考卷
• 组织学生讨论
– 阅读内容（ MIT 图灵奖得主作助教）
– 开放课题
– 设计性实验
• 防止抄袭
– Check-point( 阶段性提交 )
– 半自动代码检查抄袭
– 面试
– 在线测试

41. CS vs. EECS
• 纯 CS （ CMU, Stanford ）
– 没有传统的组成和计算机系统结构课程
– 相关课程在 ECE
• EECS （ MIT, Berkeley ）
– 有组成和系统结构课程
– 必须有较强的 EECS （ eg. Signal ）基础

42. 复旦大学课程体系（核心课程）
学年 上学期 下学期
一 高等数学 ( 上 ) 高等数学 ( 下 )
线性代数 普通物理 ( 上 )
程序设计 计算机系统基础 ( 上
二 普通物理（下） )
计算机系统工程
计算机系统基础 ( 下 ) 概率论
( 并行 ) 数据结构与算 数据库设计
法 软件工程
三 逻辑与可计算性
( 并行 ) 算法设计与分
析
Patt 《计算机系统概念》，大一入学可参考，程序部分略浅
Bryant 《深入理解计算机系统》，适合有了程序设计基础以后

43. 课程体系（系统软件方向课程）
学年 上学期 下学期
三 编译系统 数字部件设计
操作系统 计算机体系结构
分布式系统
四

44. 参考文献
• Mehran Sahami, Stanford, Computer
Science Curricula for the Coming Decade.
Nov. 3, Peking University
• 臧斌宇，复旦大学， “借鉴国际先进
经验
构建核心课程体系” . 2011 年 11 月 5
日。

45. 谢谢