CS151 2002F 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: Scheme and the Web
• Week Four: Repetition and Recursion
• Week Five: Lists, Revisited
• Week Six: Program Design
• Week Seven: Procedures, Revisited
• Week Eight: Graphics
• Break
• Week Nine: Miscellaneous
• Week Ten: Procedures, Re-Revisited
• Week Eleven: Searching
• Week Twelve: Sorting
• Week Thirteen: Object Oriented Programming
• Week Fourteen: Wrapup

Week One: Getting Started

Class 01 (Friday, August 30, 2002) Algorithms: Thinking Formally

Assignments

• Scan through the course web.
• Fill out the introductory survey.
• Email me answers to the Administrivia quiz (handout).

• Introduction; What is CS?
• An algorithm for making sandwiches

Class 02 (Monday, September 2, 2002) Introduction to the Course

Due

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

Assignments

• Read SamR's Quick HTML Reference.

• Generalizing: What techniques did we use for PBJ?
• Course basics
• About programming languages
• Administrative issues

Class 03 (Tuesday, September 3, 2002) HTML: A Formal Markup Language

Assignments

• Read Beginning Scheme for tomorrow's class.
• Skim The DrScheme Lab for tomorrow's class.
• Start Homework 1: A CS151 Site (due 11 September 2002).

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

Class 04 (Wednesday, September 4, 2002) Starting Scheme

Assignments

• Read Symbolic Values.
• Read Lists.

• Scheme basics
• Labs
  • DrScheme
  • Beginning Scheme
• Reflection

Week Two: Scheme Basics

Class 05 (Friday, September 6, 2002) Symbols and Lists

Assignments

• Read Numbers in Scheme

• Symbolic values
• Lists
• Lab

Class 06 (Monday, September 9, 2002) Numbers

Assignments

• Read Procedures

• Lab on Numbers in Scheme
• Reflection

Class 07 (Tuesday, September 10, 2002) Procedure Definitions

Assignments

• Read Boolean values.
• Read Conditionals.

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

Class 08 (Wednesday, September 11, 2002) Conditionals Lab

Due

• Homework 1: A CS151 Site.

Assignments

• Read Comments.

• The grading problem, revisited.
• Lab: Conditionals

Week Three: Scheme and the Web

Class 09 (Friday, September 13, 2002) Pause for Breath

Assignments

• HW2: Lab Writeup on Procedures and Conditionals

• Homework 1
• Problems?
  • swap-first-two
  • between
  • Others?
• Program design
  • Indentation
  • Comments (at least two types!)

Class 10 (Monday, September 16, 2002) Characters and Strings

Assignments

• Read Characters.
• Read Strings.
• Read CGI Scripting.

• Short introduction
• Lab

Class 11 (Tuesday, September 17, 2002) CGI Scripting

Assignments

• Read Randomness and Simulation.
• Read More CGI Scripting.

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

Class 12 (Wednesday, September 17, 2002) CGI Scripting, Continued

Due

• Homework 2: Lab Writeup.

Assignments

• Homework 3: A Web Story.

• Short discussion.
• Lab.

Week Four: Repetition and Recursion

Class 13 (Friday, September 20, 2002) Random Fun

Assignments

• Read Repetition with Recursion.

• Designing a dice game
• Lab: Randomness and Simulation

Class 14 (Monday, September 23, 2002) Repetition with Recursion

• Repetition
• Recursion
• Examples
• Recursion in Scheme

Class 15 (Tuesday, September 24, 2002) Recursion with Lists

Assignments

• Read Recursion with Natural Numbers.

• Reflections on Recursion
• Lab: Repetition with Recursion

Class 16 (Wednesday, September 25, 2002) More Recursion with Lists

Due

• Homework 3.

• Recursively-defined types
• Reflection
• Lab: Repetition with Recursion
• More Reflection

Week Five: Lists, Revisited

Class 17 (Friday, September 27, 2002) Recursion with Natural Numbers

Assignments

• Do HW4: Lab Writeups on Recursion.
• Read Pairs and Pair Structures.

• Introduction to numeric recursion
• Lab

Class 18 (Monday, September 30, 2002) Pairs

Assignments

• Read Association Lists.

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

Class 19 (Tuesday, October 1, 2002) Pairs, Continued

Assignments

• Read Preconditions and Postconditions.

• Turning code into diagrams and vice-versa
• Lab, continued

Class 20 (Wednesday, October 2, 2002) Association Lists

Assignments

• Exam 1 distributed.
• Read Vectors.

Due

• Homework 4: Recursion lab writeup.

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

Week Six: Program Design

Class 21 (Friday, October 4, 2002) Vectors

Assignments

• Read Naming Values with Local Bindings.

• Problems with lists
• The begin construct

Class 22 (Monday, October 7, 2002) Vectors, Continued

Assignments

• Read Naming Values with Local Bindings.

• A solution: Vectors
• Common vector procedures
• Lab

Class 23 (Tuesday, October 8, 2002) Local Bindings

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

Class 24 (Wednesday, October 9, 2002) Local Bindings, Continued

Assignments

• Reread Preconditions and Postconditions.

Week Seven: Procedures, Revisited

Class 25 (Friday, October 11, 2002) Preconditions and Postconditions, Revisited

Assignments

• Homework 5: A Literary Web Service.

Due

• Exam 1

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

Class 26 (Monday, October 14, 2002) Discussion of Exam 1

Assignments

• Read Local Procedure Bindings and Recursion

• Notes on exam 1

Class 27 (Tuesday, October 15, 2002) Local Procedure Bindings

Assignments

• Read (or reread) Local Procedure Bindings and Recursion.
• Read Higher-Order Procedures.

• Why have local procedures
• Creating local procedures
• Lab

Class 28 (Wednesday, October 16, 2002) Procedures as Values

• Design patterns, revisited
• Key ideas of higher-order procedures
  • Procedures can be parameters
  • Procedures can be anonymous
  • Procedures can return procedures
• Two key higher-order procedures
  • map
  • apply

Week Eight: Graphics

Class 29 (Friday, October 18, 2002) Procedures as Values, Continued

Assignments

• Homework 6: Writeups on Higher-Order Procedures.

Due

• Homework 5.

• Questions on readings
• Lab

Class 30 (Monday, October 28, 2002) Introduction to GIMP

Assignments

• Read Generating Gimp Images with Script-Fu.

• About this week
• Getting started with the Gimp
• Lab
• Wrapup

Class 31 (Tuesday, October 29, 2002) Script-Fu Basics

Class 32 (Wednesday, October 30, 2002) Complete Scripts

• Lab

Break

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

Week Nine: Miscellaneous

Class 33 (Friday, November 1, 2002) Script-Fu Concluded

Assignments

• Homework 7.
• Reread Randomness and Simulation.

• Lab
• Reflection

Class 34 (Monday, November 4, 2002) Simulation

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

Class 35 (Tuesday, November 5, 2002) Program Input and Output

Assignments

• Read Files.

• Interacting with programs
• Scheme's output procedures
• Scheme's input procedures
• Lab

Class 36 (Wednesday, November 6, 2002) Introduction to Files

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

Week Ten: Procedures, Re-Revisited

Class 37 (Friday, November 8, 2002) Pause for Breath

Assignments

• Exam 2: Higher-Order Scheme.
• Read Tail Recursion.

• Exam 2 distribution
• Recent questions and problems
• Files lab, continued

Class 38 (Monday, November 11, 2002) Tail Recursion

• Kinds of recursion
• Why do tail recursion
• Generating lists tail-recursively
• Lab

Class 39 (Tuesday, November 12, 2002) Tail Recursion, Continued

Assignments

• Read Variable-Arity Procedures.

• A few more notes on tail recursion
• Lab

Class 40 (Wednesday, November 13, 2002) Variable-Arity Procedures

Assignments

• Read Procedures that Return Multiple Values. Be prepared to spend some time deciphering the code.

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

Week Eleven: Searching

Class 41 (Friday, November 15, 2002) Multiple-Valued Procedures

Due

• Exam 2.

Assignments

• Homework 8: Tail Recursion.

• Why return multiple values from procedures
• How to return multiple values from procedures
• What to do with those multiple values
• An alternative

Class 42 (Monday, November 18, 2002) Discussion of Exam 2

Assignments

• Read Searching.

• General Issues
• Problem 1: Grading
  • Justifying
  • Detecting end of file
• Problem 2: map!
  • Efficiency: Don't recompute things
• Problem 3: Currying
  • Many ways of looking at a curried procedure.

Class 43 (Tuesday, November 19, 2002) Basics of Searching and Sorting

• Algorithms for common problems
• Two key problems: Searching and Sorting
• Searching Examples
• Sorting Examples

Class 44 (Wednesday, November 20, 2002) Searching: Laboratory

Assignments

• Read Sorting.
• Do Homework 9: Searching.

Due

• Homework 8: Tail Recursion

• Lab

Week Twelve: Sorting

Class 45 (Friday, November 22, 2002) Searching Lab, Continued

• Lab

Class 46 (Monday, November 25, 2002) Sorting Techniques

• The problem of sorting, revisited
• Writing sorting algorithms
• Examples
  • Insertion sort
  • Selection sort
  • Quick sort
  • Merge sort
• Formalizing the problem

Class 47 (Tuesday, November 26, 2002) Insertion Sort

Assignments

• Read Merge Sort.

• Lab
• Reflection

Class 48 (Wednesday, November 27, 2002) Pause for Breath

Due

• Homework 9.

Assignments

• Homework 10: Sorting.
• Read Records.

• Counting cons cells
• Returning more than one kind of value from a recursive procedure
• Exam discussion

Week Thirteen: Object Oriented Programming

Class 49 (Monday, December 2, 2002) Merge Sort

Assignments

• Homework 10: Sorting.
• Read Records.

• Lab
• Reflection

Class 50 (Tuesday, December 3, 2002) Records

Assignments

• Read Object-Oriented Programming.

Class 51 (Wednesday, December 4, 2002) Object Basics

Assignments

• Exam 3 (due ).
• Extra-Credit Homework: A Web Service (due ).

• Extending Objects
• Procedures as Objects
• Adding State
• Lab

Class 52 (Friday, December 6, 2002) Objects, Continued

Week Fourteen: Wrapup

Attendance is particularly important this week.

Class 53 (Monday, December 9, 2002) Exam 3

Class 54 (Tuesday, December 10, 2002) About The Course

• Grading
• Exam 3
• Wrapup

Class 55 (Wednesday, December 11, 2002) Wrapup

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

Class 56 (Friday, December 13, 2002) Discussion of Exam 3