CS151 2003S Course Syllabus

This is a highly approximate syllabus. Expect topics, assignments, ordering, and almost everything else to change.

• Week One: Getting Started
• Week Two: Scheme Basics
• Week Three: Control Structures
• Week Four: Recursion
• Week Five: Recursion, Revisited
• Week Six: Miscellaneous
• Week Seven: More Data Structures
• Week Eight: Procedures, Revisited
• Break
• Week Nine: Graphics
• Week Ten: A Web Service
• Week Eleven: Algorithms
• Week Twelve: Sorting
• Week Thirteen: Object Oriented Programming
• Week Fourteen: Wrapup

Week One: Getting Started

Class 01 (Monday, 20 January 2003) Introduction to the Course

Assignments

• Scan through the various administrative handouts (due Tue).
• Fill out the introductory survey (due Tue).
• Take the administrivia quiz (due Tue).

Handouts:

• Lab: Getting Started with the ECA.

Overview:

• Definitions: Computer science, computer programming, computing, algorithm, and more.
• Course basics.
• Getting started with the ECA.
• Administrative issues.

Class 02 (Tuesday, 21 January 2003) Algorithms: Thinking Formally

Due

• Introductory survey.
• Consideration of course web.
• Administrivia survey.

Assignments

• Read SamR's Quick HTML Reference.

Overview:

• Introduction; What is CS?
• An algorithm for making sandwiches.
• The parts of an algorithm.

Class 03 (Wednesday, 22 January 2003) HTML: A Formal Markup Language

Due

• SamR's Quick HTML References.

Assignments

• Read Beginning Scheme (due Fri).
• Scan (but do not do) The DrScheme Lab (due Fri).
• Start Homework 1: A CS151 Web Site (due next Wed).

Related Pages:

• SamR's Quick Guide to HTML
• Lab: Getting Started in the MathLAN
• Lab: Writing Hypertexts for the World Wide Web

Overview:

• About HTML.
• Logical vs. Physical Markup.
• Lab: Getting Started in the MathLAN.
• Lab: Writing Documents for the World Wide Web.

Class 04 (Friday, 24 January 2003) An Introduction to Scheme

Overview:

• Scheme basics.
• Scheme history.
• Lab: DrScheme.
• Lab: Beginning Scheme.
• Reflection.

Week Two: Scheme Basics

Class 05 (Monday, 27 January 2003) Cascading Style Sheets

Related Pages:

• Lab on Cascading Style Sheets
• sample.html, a sample page for formatting.
• sample0.css, a sample cascading style sheet.
• sample1.css, another sample cascading style sheet.

Overview:

• What are style sheets?
• Why style sheets?
• Style sheets for HTML.
• Lab.

Class 06 (Tuesday, 28 January 2003) Starting Scheme

Assignments

• Read Symbolic Values in Scheme.
• Read Lists in Scheme.

Related Pages:

• The reading on Beginning Scheme
• Lab on DrScheme
• Lab on Beginning Scheme
• Eboard 6

Overview:

• Review: Scheme Syntax.
• Lab: DrScheme.
• Lab: Beginning Scheme.
• Reflection

Class 07 (Wednesday, 29 January 2003) Symbols and Lists

Due

• Homework 1.

Assignments

• Read Numbers in Scheme.

Related Pages:

• EBoard.
• Reading on symbolic values.
• Reading on lists.
• Lab on symbols and lists.

Overview:

• Symbolic values.
• Lists.
• Lab: Symbols and Lists.

Class 08 (Friday, 31 January 2003) Numbers

Assignments

• Read Defining Procedures in Scheme.

Related Pages:

• EBoard.
• Reading on numbers.
• Lab on numbers.

Overview:

• Types.
• Numbers, Kinds of Numbers, and Numeric Operations.
• Lab on Numbers in Scheme.
• Reflection.

Week Three: Control Structures

Class 09 (Monday, 3 February 2003) Procedure Definitions

Handouts:

• Notes on Homework 1.

Related Pages:

• EBoard.
• Reading on Procedures.
• Lab on Procedures.

Overview:

• Why define your own procedures?
• How to define your own procedures.
• Lab.

Class 10 (Tuesday, 4 February 2003) Conditionals

Assignments

• Laboratory Writeup 1: Procedures and Conditions.
• Read Boolean Values and Predicates.

Related Pages:

• EBoard.
• Reading on Conditionals in Scheme.

Overview:

• A problem: Turning numbers into letters (in English and Scheme).
• Making life easier: Conditionals

Class 11 (Wednesday, 5 February 2003) Conditionals Lab

Assignments

• Read Characters in Scheme.
• Read Strings in Scheme.

Related Pages:

• EBoard.
• Reading on Conditionals in Scheme.
• Lab on Conditionals in Scheme.

Overview:

• The grading problem, revisited.
• Lab: Conditionals.

Class 12 (Friday, 7 February 2003) Characters and Strings

Assignments

Read CGI Scripting in Scheme.

Related Pages:

• EBoard.
• Reading on Characters.
• Reading on Strings.
• Lab on Strings.

Overview:

• Short introduction to strings.
• Lab: Characters and Strings.

Week Four: Recursion

Class 13 (Monday, 10 February 2003) CGI Scripting

Due

• Lab writeup 01.

Related Pages:

• EBoard.
• Reading on CGI.
• Lab on CGI.

Overview:

• What is CGI?
• Giving input to CGI programs.
• Reading input in CGI programs.
• Lab: CGI.

Class 14 (Tuesday, 11 February 2003) CGI Scripting, Continued

Assignments

• Homework 2: Mad Libs.

Related Pages:

• EBoard.
• Reading on CGI.
• Lab on CGI.
• Optioanl lab on CGI.

Overview:

• Short discussion.
• First Lab.
• Second Lab.
• Reflection.

Class 15 (Wednesday, 12 February 2003) Repetition with Recursion

Assignments

• Read Repetition with Recursion.

Related Pages:

• EBoard.
• Reading on Recursion (assigned today).

Overview:

• Repetition.
• Recursion.
• Examples.
• Recursion in Scheme.

Class 16 (Friday, 14 February 2003) Recursion Lab

Related Pages:

• EBoard.
• Previous EBoard (discussion of reecursion).
• Reading on Recursion.
• First Lab on Recursion.

Overview:

• Q&A on recursion.
• Lab.
• Reflection.

Week Five: Recursion, Revisited

Class 17 (Monday, 17 February 2003) Recursion with Lists (1)

Due

• Homework 2.

Assignments

• Lab Writeup 2 (optional).

Related Pages:

• EBoard.
• Reading on Recursion.
• First Lab on Recursion.
• New Lab on List Recursion.

Overview:

• Reflections on Recursion.
• Lab: List Recursion, Revisited.

Class 18 (Tuesday, 18 February 2003) Recursion with Lists (2)

Assignments

• Read Recursion with Natural Numbers.

Related Pages:

• EBoard.
• Reading on Recursion.
• Lab on List Recursion.

Class 19 (Wednesday, 19 February 2003) Recursion with Natural Numbers (1)

Assignments

• Exam 1.

Related Pages:

• EBoard.
• Reading on Numeric Recursion.
• Lab on Numeric Recursion.

Overview:

• Introduction to numeric recursion.
• Lab.

Class 20 (Friday, 21 February 2003) Recursion with Natural Numbers (2)

Assignments

• Read Preconditions and Postconditions.

Related Pages:

• EBoard.
• Reading on Numeric Recursion.
• Lab on Numeric Recursion.

Week Six: Miscellaneous

Class 21 (Monday, 24 February 2003) Preconditions and Postconditions

Assignments

• Read Local bindings with let.

Related Pages:

• EBoard.
• Reading on Preconditions and Postconditions.
• Lab on Preconditions and Postconditions.

Overview:

• The need for documentation.
• Verifying preconditions.
• An example: Sum of squares.
• Husk and Kernel programming.
• Other uses of Husk and Kernel.
• Lab.

Class 22 (Tuesday, 25 February 2003) Local Bindings

Related Pages:

• EBoard.
• Reading on Local Bindings.

Overview:

• Why name things.
• Naming things with let.
• Naming things with let*.
• Naming procedures.

Class 23 (Wednesday, 26 February 2003) Laboratory: Local Bindings

Assignments

• Read Local Procedure Bindings and Recursion.

Related Pages:

• EBoard.
• Reading on Local Bindings.
• Lab on Local Bindings.

Overview:

• Lab.

Class 24 (Friday, 28 February 2003) Local Procedure Bindings

Due

• Lab Writeup 2 (optional).
• Exam 1.

Assignments

• Homework 3: Web Services.
• Read Pairs and Pair Structures.

Related Pages:

• EBoard.
• Reading on Local Procedure Definitions.
• Lab on Local Procedure Definitions.

Overview:

• Why have local procedures.
• Creating local procedures.
• Lab.

Week Seven: More Data Structures

Class 25 (Monday, 3 March 2003) Simulation

Related Pages:

• EBoard.
• Reading on Simulation.
• Lab.

Overview:

• The Problem of Simulation.
• Scheme's random procedure.
• Simulating the roll of dice.
• Lab.

Class 26 (Tuesday, 4 March 2003) Pairs

Assignments

• Read Association Lists.

Related Pages:

• EBoard.
• Reading on Pairs.
• Lab on Pairs.

Overview:

• Behind the scences in Scheme: Memory.
• Pairs and Cons cells.
• Dotted pairs.
• Lab.

Class 27 (Wednesday, 5 March 2003) Association Lists

Assignments

• Read Vectors.

Related Pages:

• EBoard.
• Reading on Association Lists.
• Lab on Association Lists.

Overview:

• Databases and dictionaries.
• Lists as dictionaries.
• assoc, a procedure for searching lists.
• Lab.

Class 28 (Friday, 7 March 2003) Vectors

Due

• Homework 3: Web Services.

Related Pages:

• EBoard.
• Reading on Vectors.
• Lab on Vectors.

Overview:

• Problems with lists.
• A solution: Vectors.
• Side note: The begin construct.
• Lab.

Week Eight: Procedures, Revisited

Class 29 (Monday, 10 March 2003) Deep Recursion

Assignments

• Read the reading on higher-order procedures.

Related Pages:

• EBoard.

Overview:

• List recursion, revisited.
• Deep recursion, considered.
• Group design example 1: count-elements.
• Group design example 2: depth.

Class 30 (Tuesday, 11 March 2003) Procedures as Values

Assignments

• Read More Higher-Order Procedures.

Related Pages:

• EBoard.
• Reading on higher-order procedures.
• Lab on higher-order procedures.

Overview:

• Design patterns, revisited.
• Key ideas of higher-order procedures.
• Two key higher-order procedures: map and apply.
• Lab.

Class 31 (Wednesday, 12 March 2003) Procedures as Values, Continued

Related Pages:

• EBoard.
• First reading on higher-order procedures.
• Second reading on higher-order procedures.
• First lab on higher-order procedures.
• Second lab on higher-order procedures.

Overview:

• Procedures that build procedures.
• Building predicates.
• Building recursive procedures.
• Why use higher-order procedures?
• Old lab, continued.
• New lab, initiated.

Class 32 (Friday, 14 March 2003) Early Break

Break

Break runs from 5:00 p.m. on Friday, March 17, 1998 to 8:00 a.m. on Monday, April 3.

Week Nine: Graphics

Class 33 (Monday, 31 March 2003) Introduction to the GNU Image Manipulation Program

Assignments

• Exam 2: Recursion (due April 8).
• Read Scripting the Gimp with Script-Fu.

Related Pages:

• EBoard.
• Lab on the Gimp.

Overview:

• About the Gimp.
• This week.
• Getting started with the Gimp.
• Lab.
• Wrapup.

Class 34 (Tuesday, 1 April 2003) Script-Fu Basics

Assignments

• Exam 2.

Related Pages:

• EBoard.
• Reading on Script-Fu.
• First Script-Fu Lab.

Overview:

• About Script-Fu.
• Lab.
• Reflection.

Class 35 (Wednesday, 2 April 2003) Complete Scripts

Related Pages:

• EBoard.
• First Reading on Script-Fu.
• First Script-Fu Lab.

Overview:

• Writing Script-Fu Procedures.
• An example: Drawing a circle.
• Project: Drawing a Random Circle.
• Project: Creating a New Image.
• Project: Drawing a Star.
• Project: Tracing a Picture.
• Project: Choose Your Own.

Class 36 (Friday, 4 April 2003) Algorithmic Art

Assignments

• Read Output in Scheme.
• Read Input in Scheme.

Related Pages:

• EBoard.
• Online Class Images.
• circles.scm, the code we wrote yesterday (with some variations).
• art.scm, some useful code for today's lab.
• Lab on Algorithmic Art.

Overview:

• About Images.
• Algorithmically generating and modifying images.
• Lab.

Week Ten: A Web Service

Class 37 (Monday, 7 April 2003) Input and Output

Assignments

• Read Files in Scheme.

Related Pages:

• EBoard.
• Reading on Input.
• Reading on Output.
• Lab on Input and Output in Scheme.

Overview:

• Interactive programs.
• Output in Scheme.
• Input in Scheme.
• Lab.

Class 38 (Tuesday, 8 April 2003) Files

Due

• Exam 2.

Assignments

• Read Variable-Arity Procedures.

Related Pages:

• EBoard.
• Reading on Files.
• Lab on Files.

Overview:

• Files and ports.
• Reading values.
• Reading characters and lines.
• Lab.

Class 39 (Wednesday, 9 April 2003) Variable-Arity Procedures

Related Pages:

• EBoard.
• Reading on Variable-Arity Procedures.
• Lab on Variable-Arity Procedures.

Overview:

• Definition of arity.
• Why have variable-arity procedures.
• How to write variable-arity procedures.
• Lab.

Class 40 (Friday, 11 April 2003) Discussion of Exam 2

Due

• Project Proposal.

Assignments

• Read Tail Recursion.
• Start the first implementation phase of the project.

Related Pages:

• EBoard.
• Notes on Exam 2.

Overview:

• General Issues.

Week Eleven: Algorithms

Class 41 (Monday, 14 April 2003) Tail Recursion (1)

Related Pages:

• EBoard.
• Reading on Tail Recursion.
• Lab on Tail Recursion.

Overview:

• Kinds of recursion.
• Why do tail recursion.
• Generating lists tail-recursively.
• Lab: Tail Recursion.

Class 42 (Tuesday, 15 April 2003) Tail Recursion (2)

Due

• Project, Phase 1

Assignments

• Project, Phase 2

Related Pages:

• EBoard.
• Reading on Tail Recursion.
• Reading on Timing Expression Evaluation.
• Lab on Tail Recursion.

Overview:

• A note on timing.
• Lab: Tail Recursion.

Class 43 (Wednesday, 16 April 2003) Basics of Searching and Sorting

Assignments

• Read Searching.

Related Pages:

• EBoard.

Overview:

• Algorithms for common problems.
• Two key problems: Searching and Sorting.
• Searching Examples.
• Sequential Search.
• Binary Search.
• Searching in Scheme.

Class 44 (Friday, 18 April 2003) Binary Search

Related Pages:

• EBoard.

Week Twelve: Sorting

Class 45 (Monday, 21 April 2003) Sorting Out Sorting

Class 46 (Tuesday, 22 April 2003) Searching Lab

Related Pages:

• EBoard.
• Reading on Searching.
• Lab on Searching.

Overview:

• Lab.

Class 47 (Wednesday, 23 April 2003) Sorting Techniques

Assignments

• Read Sorting.

Related Pages:

• EBoard.

Overview:

• Binary Search, Revisited.
• The problem of sorting, revisited.
• Writing sorting algorithms.
• Examples: Insertion, Selection, Quick, Merge.
• Formalizing the problem.

Class 48 (Friday, 25 April 2003) Sorting Lab

Related Pages:

• EBoard.
• Reading on Sorting.
• Lab on Insertion Sort.

Overview:

• The Six P's of Sorting.
• Lab.

Week Thirteen: Object Oriented Programming

Class 49 (Monday, 28 April 2003) Project Presentations

Assignments

• Start Exam 3 (due next Tuesday).
• Read Merge Sort (due this Tuesday).

Related Pages:

• EBoard.

Overview:

• Overview of Projects.
• The Grinnell Stress Test.
• Buy, Sell, Free.
• Poker.
• Triangle.

Class 50 (Tuesday, 29 April 2003) Merge Sort

Assignments

• Read Records in Scheme.

Related Pages:

• EBoard.
• Reading on Merge Sort.
• Lab on Merge Sort.
• mergesort.ss.

Overview:

• Lab.
• Reflection.

Class 51 (Wednesday, 30 April 2003) Records

Assignments

• Read Objects in Scheme.

Related Pages:

• EBoard.
• Reading on Records.
• Records Lab.
• compound.ss.

Overview:

• Grouping Data.
• The Record.
• Records in Scheme.
• Lab.

Class 52 (Friday, 2 May 2003) In Class Exam 3

Week Fourteen: Wrapup

Attendance is particularly important this week.

Class 53 (Monday, 5 May 2003) Object Basics

Assignments

• Read About End-of-course Evaluations (due Wed).
• Fill out the development evaluation (distributed in paper form) (due Wed).

Related Pages:

• EBoard.
• Reading on Objects in Scheme.
• ec.ss, the sample code written in class.
• Lab on Objects in Scheme.

Overview:

• Extending Objects.
• Procedures as Objects.
• Adding State.
• Lab: Object-Oriented Programming.

Class 54 (Tuesday, 6 May 2003) Object Lab

Related Pages:

• EBoard.
• ec.ss, the sample code written in class yesterday.
• Reading on Objects in Scheme.
• Lab on Objects in Scheme.

Overview:

• Lab: Objects in Scheme.

Class 55 (Wednesday, 7 May 2003) Course Evaluation

Due

• Exam 3.

Overview:

• Final project presentations.
• About evaluations.
• Evaluations.
• Final statements.

Class 56 (Friday, 9 May 2003) Wrapup

Overview:

• Final comments.