CS 9D. Scheme for Programmers
Current Schedule (Fall 2014)
- CS 9D: Paul N. Hilfinger, 200A Sutardja Dai
Catalog Description: (1 unit) Self-paced course in functional programming, using the Scheme programming language, for students who already know how to program. Recursion; higher-order functions; list processing; implementation of rule-based querying.
Prerequisites: Programming experience similar to that gained in Eng 77N.
Course objectives: Students are expected to learn the basics of Scheme programming (up through recursion, applicative operators, and the use of functions as first class objects). In the process of learning the language, they will be applying knowledge of mathematics, science and engineering. As many of their projects require a fair bit of software engineering, they will also be making design decisions (algorithm, data structure, time-vs-space, etc) and considering various implementation trade-offs.
- Functions and recursion using numbers
- Higher-order functions
- Lists and hierarchical data; list-processing recursion; higher-order functions with lists; functions as stored data
- Rule-based programming