Readings

The following readings are required, and should be completed before class on the date listed.

September 3

• Parts of algorithms
• Grinnell's GNU/Linux Environment
• The DrRacket Programming Environment
• Beginning Scheme

September 5

• Data types
• Numeric values in Scheme
• Characters and strings in Scheme
• Symbolic values in Scheme

September 7

• Making and manipulating simple lists
• How Scheme evaluates expressions (take 1)

September 10

• Defining your own procedures
• How Scheme Evaluates Expressions (take 2)

September 12

• How Pair Programming Really Works

       Stuart Wray, IEEE Software

September 14

• Documenting your procedures

September 17

• Testing your procedures with RackUnit

September 19

• Heterogeneous lists
• Representing tables

September 21

• Reading data from files

September 24

• Boolean values and predicate procedures
• Filtering lists

September 26

• Naming values with local bindings
• A computer scientist's perspective on data science

September 28

• Conditional evaluation in Scheme

October 3

• Displaying data

October 5

• Verifying preconditions

October 8

• Recursion basics

October 10

• Recursion basics

October 12

• Recursion with helper procedures

October 15

• List recursion, revisited

October 17

• Numeric recursion

October 19

• Local procedure bindings for recursive procedures

October 29

• Debugging your programs

October 31

• Randomness and simulation

November 2

• Pairs and pair structures

November 5

• Vectors

November 7

• Files in Scheme

November 9

• Design patterns and higher-order procedures

November 12

• Binary trees

November 14

• Analyzing procedures

November 16

• Association lists

November 28

• Algorithms for searching lists and vectors

December 5

• Algorithms for sorting lists and vectors

December 7

• Merge sort