Readings

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

24 January 2018

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

26 January 2018

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

29 January 2018

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

31 January 2018

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

2 February 2018

• Wray: How Pair Programming Really Works
• A computer scientist's perspective on data science

5 February 2018

• Documenting your procedures

7 February 2018

• Testing your procedures with RackUnit

9 February 2018

• Debugging your programs

12 February 2018

• Heterogeneous lists
• Representing tables

14 February 2018

• Reading data from files

16 February 2018

• Boolean values and predicate procedures
• Filtering lists

21 February 2018

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

23 February 2018

• Conditional evaluation in Scheme

26 February 2018

• Displaying data

28 February 2018

• Verifying preconditions

2 March 2018

• Recursion basics

5 March 2018

• Recursion basics

7 March 2018

• Recursion with helper procedures

9 March 2018

• List recursion, revisited

12 March 2018

• Numeric recursion

14 March 2018

• Local procedure bindings for recursive procedures

16 March 2018

• Randomness and simulation

2 April 2018

• Pairs and pair structures

4 April 2018

• Vectors

6 April 2018

• Binary trees

9 April 2018

• Design Patterns and Higher-Order Procedures

11 April 2018

• Files in Scheme

13 April 2018

• Analyzing procedures

18 April 2018

• Association lists

23 April 2018

• Algorithms for searching lists and vectors

30 April 2018

• Algorithms for sorting lists and vectors

2 May 2018

• Merge sort