Readings

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

2 April 2021

• An Introduction to the course
• Algorithm building blocks
• The DrRacket programming environment
• An abbreviated introduction to Racket

5 April 2021

• Simple images in Racket
• Decomposition

6 April 2021

• Writing your own procedures
• Mental models of computation

7 April 2021

• Expressions and types
• Numeric values
• Characters and strings
• Symbolic values in Racket

8 April 2021

• Boolean values and predicate procedures
• Conditional evaluation in Scheme

12 April 2021

• {"title"=>"How pair programming really works (Wray)", "resource"=>"/files/PairProgramming.pdf"}

14 April 2021

• List basics
• Transforming lists

15 April 2021

• Anonymous procedures
• The "big three" list operations
• More list operations

16 April 2021

• Text and text files
• Regular expressions

19 April 2021

• Naming values with local bindings

20 April 2021

• Documenting Your Code

21 April 2021

• Testing your procedures with RackUnit
• Hypothesis-driven debugging (Notes)

22 April 2021

• Recursion basics

26 April 2021

• Recursive Skeletons
• Numeric recursion

28 April 2021

• Tail Recursion

29 April 2021

• Higher-order Recursive Design

3 May 2021

• Randomness and simulation

4 May 2021

• Pairs and pair structures
• Vectors

5 May 2021

• Dictionaries, maps, and hash tables

10 May 2021

• Trees

11 May 2021

• Tree recursion

12 May 2021

• Analyzing procedures
• Algorithms for searching lists and vectors

13 May 2021

• No reading

14 May 2021

• Algorithms for sorting lists and vectors

18 May 2021

• Merge sort

19 May 2021

• Displaying data