Readings

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

28 August 2017

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

30 August 2017

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

1 September 2017

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

4 September 2017

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

6 September 2017

• Wray: How Pair Programming Really Works

8 September 2017

• Documenting your procedures

11 September 2017

• Testing your procedures with RackUnit

13 September 2017

• Heterogeneous lists
• Representing tables

15 September 2017

• Reading data from files

18 September 2017

• Boolean values and predicate procedures
• Filtering lists

20 September 2017

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

22 September 2017

• Conditional evaluation in Scheme

27 September 2017

• Displaying data

29 September 2017

• Verifying preconditions

2 October 2017

• Recursion basics

4 October 2017

• Recursion basics

6 October 2017

• Recursion with helper procedures

9 October 2017

• List recursion, revisited

11 October 2017

• Numeric recursion

13 October 2017

• Local procedure bindings for recursive procedures

23 October 2017

• Debugging your programs

25 October 2017

• Randomness and simulation

27 October 2017

• Pairs and pair structures

30 October 2017

• Vectors

1 November 2017

• Binary trees

3 November 2017

• Design Patterns and Higher-Order Procedures

6 November 2017

• Files in Scheme

13 November 2017

• Analyzing procedures

15 November 2017

• Association lists

20 November 2017

• Algorithms for searching lists and vectors

29 November 2017

• Algorithms for sorting lists and vectors

1 December 2017

• Merge sort