Problem Set 10 - Due Tue Dec 7 at 23:59

Reading

  1. Slides and notebooks from Lec 22 (Intro to Recursion) and to some degree from Lec 23 (Fruitful Recursion).
  2. Problems and solutions from Lab 11 (Recursion).
  3. Think Python, Ch. 5, Sections 5.8–5.10 on recursion, and Think Python, Ch. 6, Sections 6.5–6.9 on fruitful recursion.

Tasks

The instructions for each task and their specific requirements are laid out on the following pages:


About this Problem Set

This problem set will give you practice with basic recursion, without needing fruitful recursion.

If you want to find a partner to work with for this problem set, use this Google Sheet to do so.

Notes

The first two tasks are alternates: you must complete one or the other, but you do not have to complete both.

Time Estimate

To help you plan how long you need to spend on this problem set, we have some guidelines based on how long students spent on these tasks last semester (please fill out your time estimates to help students in future semesters). Note that this semester, due to the large number of new tasks, these numbers are often just estimates.

When you've been working on a task for about 2 hours, you should evaluate whether you are making efficient progress, and make use of some of the class resources available to you, like help-room hours or office hours. If you've been working on one task for 4 hours and still have a ways to go, you should definitely get some help with it.

The entire problem set will probably take you something like 5–8 hours of programming, plus another half hour to hour of reading, although some students take more or less time than that.


How to turn in this Problem Set