CS2013-final-report

Additional Comments
We instituted a major revision of the undergraduate CS curriculum at Stanford in 2008. Since
then we have continued to make minor revisions in the curriculum, but do not anticipate making
another significant change in the foreseeable future. In performing the mapping of our
curriculum against the CS2013 guidelines, we realized that there are a few Core-Tier1 learning
outcomes that we currently do not cover in our typical program (hence the 98% coverage of
Core-Tier1, as opposed to 100%). We believe that we can cover the additional 2% of Core-Tier1
learning outcomes through minor, localized changes in existing courses, so no significant
curricular changes are currently planned.
Appendix: Information on Individual Courses
Below is the detailed course information for the courses in the sample program described above.
The full set of CS courses offered at Stanford is too large to include here, but is available in the
university online course catalog. Courses are listed below in numeric order. Note that numeric
order does necessarily reflect the order in which students would likely take these courses. For
example, CS103 has CS106A—a higher numbered course—as a prerequisite.
CS 103: Mathematical Foundations of Computing
Mathematical foundations required for computer science, including propositional predicate logic,
induction, sets, functions, and relations. Formal language theory, including regular expressions,
grammars, finite automata, Turing machines, and NP-completeness. Mathematical rigor, proof
techniques, and applications. Prerequisite: 106A or equivalent.
URL: http://www.stanford.edu/class/cs103/
(Also listed as a course exemplar in CS2013)
CS 106A: Programming Methodology
Introduction to the engineering of computer applications emphasizing modern software
engineering principles: object-oriented design, decomposition, encapsulation, abstraction, and
testing. Uses the Java programming language. Emphasis is on good programming style and the
built-in facilities of the Java language. No prior programming experience required.
URL: http://www.stanford.edu/class/cs106a/
CS 106B: Programming Abstractions
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. Prerequisite: 106A or equivalent.
URL: http://www.stanford.edu/class/cs106b/
- 499 -