©2007 Felleisen, Proulx, et. al.

0  Accumulator-Style Program Design

Etudes

Work out the problems 31.3.3, 31.3.4, 31.3.6, and 31.3.7 in the HtDP textbook.

Main Assignment

0.1  Problem

A list of Posns represents points on a route we traverse.

1. Design the function that computes the total distance of our traversal.

2. Design the function that determines the minimum distance between two consecutive Posns in this list.

 Solution

0.2  Problem

A binary search tree of Strings represents the names of students in a class roster.

1. Design the function that produces a list of all names in the given binary search tree, arranged in the same order as in the given binary search tree.

 Solution