哈佛的《计算机科学导论》是为全体本科生开设的计算机入门课程，它不需要计算机的任何经验和基本知识。该课程的教学大纲，作业及教学视频全部在网上公开。有兴趣的网友可登录

http://www.cs50.net 观看教学视频。

这是我所见到的最好的讲课，你看完后一定深有同感：

他不是讲课，而是激情讲演；

他不是老师，而是激情投入的演员；

哈佛老师不是白领，而是劳动强度极大的蓝领；

学生绝不会打瞌睡，而要随老师的思维高速运转；

1. 关于讲师

讲师：David Malan, 分别于1999年，2004年，2007年在哈佛获学士，硕士和博士学位。

2. 课时安排

每周一，周三，下午1：00到2：30；共13周，约49小时。

课后每周要求安排5小时来完成作业。

3. 评价体系

测评由以下3种组成：编程（权重60%），小测验（权重30%）和最终项目（权重10%）

Problem Sets (best 8 out of 9): 60%
Quizzes: 30%
Final Project: 10%

最终项目实际上是课程结束时提交的能解决某些问题的应用软件。

编程作业在基本上每节课后都有安排，共有9次。

小测验有2次：

Quiz 0
Wed 10/14 Covers weeks 0 through 5.
Quiz 1
Wed 11/18 Covers weeks 0 through 10 with emphasis on 7 onward.

4. 课本

由于网络发达，没有课本。

老师推荐的课本如下:

For Those Less Comfortable(对基础较差的学生)
Absolute Beginner’s Guide to C, Second Edition
Greg Perry
Sams Publishing, 1994
ISBN 0-672-30510-0

For Those More Comfortable(对基础较好的学生)
Programming in C, Third Edition
Stephen Kochan
Sams Publishing, 2004
ISBN 0-672-32666-3

5. 教学内容

Week 0
Wed 9/2, Fri 9/4
Introduction. Bits. Binary. ASCII. Programming. Algorithms. Scratch. Statements.
Boolean expression_rs. Conditions. Loops. Variables. Threads. Events.
Week 1
Wed 9/9, Fri 9/11
C. Source code. Compilers. Object code. SSH. SFTP. GCC. Functions. Comments.
Standard output. Arithmetic operators. Precedence. Associativity. Local variables. Types.
Casting. Standard input. Libraries. Boolean expression_rs, continued. Conditions, continued.
Loops, continued.
Week 2
Mon 9/14, Wed 9/16
Functions, continued. Global variables. Parameters. Return values. Stack. Frames. Scope.
Arrays. Strings. Command-line arguments. Cryptography.
Week 3
Mon 9/21, Wed 9/23
Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble
sort. Selection sort. Insertion sort. Merge sort. Debugging.
Week 4
Mon 9/28, Wed 9/30
Structures. Dynamic memory allocation. Stack and heap. Pointers. Debugging, continued.
Week 5
Mon 10/5, Wed 10/7
File I/O. Forensics. Linked lists. Stacks. Queues.
Week 6
Wed 10/14
Quiz 0 on Wed 10/14.
Week 7
Mon 10/19, Wed 10/21
Valgrind. Bitwise operators. Hash tables. Trees. Binary search trees. Tries. Heaps.
Heapsort. Huffman coding.
Week 8
Mon 10/26, Wed 10/28
TCP/IP. HTTP. XHTML. PHP. SQL.
Week 9
Mon 11/2, Wed 11/4
DOM. CSS. Inheritance. JavaScript. Events, continued. OOP. Ajax.
Week 10
Mon 11/9
Preprocessing. Compiling. Assembling. Linking. CPUs.
Week 11
Mon 11/16, Wed 11/18
Guest lectures.
Quiz 1 on Wed 11/18.
Week 12
Mon 11/23
Exciting conclusion.