Readings

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

January 24

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

January 27

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

January 29

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

January 31

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

February 3

• How Pair Programming Really Works

       Stuart Wray, IEEE Software

February 5

• Documenting your procedures

February 7

• Testing your procedures with RackUnit

February 10

• Heterogeneous lists
• Representing tables

February 12

• Reading data from files

February 14

• Boolean values and predicate procedures
• Filtering lists

February 17

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

February 19

• Conditional evaluation in Scheme

February 21

• Displaying data

February 26

• Verifying preconditions

February 28

• Recursion basics

March 2

• Recursion basics

March 4

• Recursion with helper procedures

March 6

• List recursion, revisited

March 9

• Numeric recursion

March 11

• Local procedure bindings for recursive procedures

March 13

• Debugging your programs

March 30

• Randomness and simulation

April 1

• Pairs and pair structures

April 3

• Vectors

April 6

• Files in Scheme

April 8

• Design patterns and higher-order procedures

April 10

• Binary trees

April 13

• Analyzing procedures

April 15

• Association lists

April 17

• Class Project

April 22

• Algorithms for searching lists and vectors

April 29

• Algorithms for sorting lists and vectors

May 4

• Merge sort