|
|
A lab-based introduction to basic ideas of computer science, including recursion, abstraction, state, information-hiding, and the design and analysis of algorithms. Includes introductory programming in a high-level, functional language. Prerequisites: None.This means that you'll be introduced to the basics of computation, learning how to adequately describe and decompose problems of a computational nature so that you can effectively tell a computer the steps it should take to solve the problem. We will study some beginning concepts that make this process possible, easier to undertake, and often elegant. Our major objectives for this course include:
Dybvig, Kent R., The Scheme Programming Language (Third Edition), MIT Press, 2003.
http://www.scheme.com/tspl3
An effective guide to learning the Scheme language.
Felleisen, Matthias, Findler, Robert Bruce, Flatt, Matthew and Krishnamurthi, Shriram, How to Design Programs, MIT Press 2001.
http://www.htdp.org
A wonderful guide, particularly for later topics in the course like higher-order programming, re-factoring, and recursion.
Kelsey, Richard, Clinger, William, and Rees, Jonathan, editors, Revised5 Report on the Algorithmic Language Scheme. 1998.
http://www.cs.grinnell.edu/courses/Scheme/r5rs-html/r5rs_toc.html
http://www.cs.grinnell.edu/~weinman/courses/CSC151/doc/r5rs.pdf
The complete, concise definition of the Scheme programming language.
| Week | Topic | Week | Topic | |
| 1 | Introduction | 8 | Geometric art, files | |
| 2 | Graphics, procedures, and style | 9 | Pixel maps | |
| 3 | Numbers, images, and color | 10 | Vectors, analysis, data structures | |
| 4 | Conditionals, list iteration | 11 | Deep recursion, association lists | |
| 5 | Transforming colors/images | 12 | Higher-order procedures, search | |
| 6 | Recursion | 13 | Sorting | |
| 7 | Preconditions, local procedures | 14 | Summary and review |
| \checkmark+ | Exhibits exceptional insight and/or craftmanship |
| \checkmark | Meets the requirements of the assignment. |
| \checkmark- | Does not meet the requirements of the assignment. |
| Exam 1 | Wednesday 11 February |
| Exam 2 | Wednesday 8 April |
| Exam 3 | Monday 4 May |
| Final Exam | Friday 15 May (9 am) |
| Participation | 10% |
| Homework | 20% |
| Project | 10% |
| Quizzes | 20% |
| Exams | 30% |
| Labs | 10% |
| 2-4 absences | 20% |
| 5-7 absences | 40% |
| 8 or more absences | 60% |