Problem Set 4 - Due Tue Feb 22 at 23:00

Reading

1. Slides and notebooks from Lec 3/4/5, Lec 6, and Lec 7
2. Problems and solutions from Lab 3 and Lab 4
3. Think Python, Chapter 3 covers functions, and Think Python, Chapter 6 covers fruitful functions, although sections 6.4 through 6.6 are material that we'll cover later.
4. Think Python, Chapter 3 and Think Python, Chapter 6 cover material on functions which remains relevant; section 6.4 is especially relevant now, although sections 6.5 and 6.6 are still stuff that we're going to introduce later.
5. Think Python, Chapter 5 covers booleans and conditionals, although sections 5.8 through 5.10 cover recursion which we will save for later, so you can skip those for now.

---

Tasks

The instructions for each task:

• Task 1: Animal Quiz — Ask the user some questions to decide (using booleans and conditionals) what kind of animal they might be. This is an individual task.

• Task 2: Exploration Policies — Write policies to control a robot stuck in a maze. For this problem, having a partner is optional but recommended.

---

About this Problem Set

This problem set will give you practice with the use of booleans and conditionals. You will also continue to define your own functions.

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

Reminders

• Remember to download the starter code for each task from the Potluck server.
• You can also use the server to take a 24-hour extension on this problem set if you need to.
• You should check the rubric for each task before you submit.

Time Estimate

Our per-task estimate for this pset is 2-3 hours, and our estimate for total time spent across all tasks is 5–8 hours, plus up to an hour of reading.

---

How to turn in this Problem Set

• Upload your tasks via the Potluck server by the deadline (Tue Feb 22 at 23:00).

  • For animalQuiz, submit animalQuiz.py.
  • For mazePolicies, each team member must submit mazePolicies.py.

• Double-check the status of your submitted tasks, since there may be warnings.

• Reminder: you can submit as many times as you like, and only the most recent submission will count for your grade.

• If you run into trouble with the submissions server, contact Prof. Mawhorter, and include a copy of the file(s) you were trying to submit.

• After the deadline, check your score for each task and submit revisions if you need to.

---