CS111A Project 08: Dictionaries and Directories -- Due Thu Wed Nov 18 at 23:00
Try to complete Task 1 (checklist) by Fri Nov 13 at 23:00
Try to complete Task 2 (remarkableMultiplesFast) by Wed Nov 18 at 23:00
Reading
- Slides and notebooks from the Dictionaries lecture.
- Slides and notebooks from the Dictionary Accumulation Patterns lecture
- Slides and notebooks from the Directories lecture
- All exercises from Exercises 08
About this Project
This project will give you practice with dictionaries.
Tasks
For this project you must do both of the following tasks.
-
Task 1: Checklist — Define an API to use dictionaries as checklists. This is an individual task that you must do on your own.
- Task 2: Fast Remarkable Multiples — Based on a simple proof of why every positive integer has a remarkable multiple, use dictionaries to find least remarkable multiples in a stunningly fast way! This is an individual task that you must do on your own.
Project08 previously contained a Task 3 named Last Dance. This task might no longer be covered this semester (or might be offered for extra credit instead).
How to Submit this Project
Note: You should submit the task file for each task as soon as you finish it, but you may also revise and resubmit any task files after you have reviewed the grading feedback from Project 07.
After you finish each task, drag and drop all of the folowing two files that you have completed so far into the CS111A Gradescope Project08 assignment.
checklist.py(from Task 1)remarkableMultiplesFast.py(from Task 2)
You may resubmit as many times as you like, but in each resubmission you must include all of the files you have completed so far.