HW8 (due Sun. 30-Jul, 8pm)

From the syllabus: Homework assignments will be primarily completed on the CMU CS Academy website with few exceptions. These assignments will include code tracing exercises and free response exercises requiring writing code, which are all generally autograded. The homework allows you to get practice on solving problems in an untimed environment with unlimited tries to automatically check solutions in CS Academy. The lowest two homework grades will be half-weighted.

Homeworks are entirely solo unless the assignment very explicitly allows you to collaborate. See the "Academic Integrity" section below for more details. That said, you always have access to extensive help provided by the TAs and course faculty. To get help on the homework assignments, you can go to daily office hours and/or post questions to Piazza.

To recieve credit for completing a homework assignment you must have a green checkmark next to it CS Academy. A green checkmark next to a problem means it has autograded correctly and you are done. No green checkmark means it's not done yet. If you believe you should have received a green checkmark, be sure to review your work, and be sure that you hit the "check" button after the "run" button to submit it. The "check" button runs your code against additional hidden test cases which you must pass in order to receive credit. It's your responsibility to properly submit and be aware of whether you have received green-checkmark credit for your work! There is generally no partial credit for autograded problems.

Important Notes:

Each CS Academy assignment will show a required "stars" in exercise sections, listed like this:
"Section Exercises: ⭐ 0 / 0."
Ignore these numbers. For this class they have no meaning. You must complete the problems described below.
Do not hardcode to the test cases in your solutions.
Do not use recursion on these homework problems. In some cases, CS Academy will probihit you from doing so, and in others will not. We may check some solutions and if you use these constructs you will recieve a 0 for those problems.
There are no bonus stars available in this unit. You should spend some time thinking about what you might like to build for your term project and work on TP0. We will also release the recursion pre-reading earlier than normal.

In CS Academy, complete problems below.
For each section, we list the required problems. The point values they are worth are shown here in parentheses like this: (2). They are the same points values shown in CS Academy, except for the bonus question.

Total points: 9

Unit 7: Object Oriented Programming (OOP)
- 7.10 Guided Exercises:
  - Line Puzzle Classes (2)
  - Line Puzzle (2)
- 7.11 Section Exercises:
  - Polynomial (1)
    - Note that the test cases for hashing are somewhat broken for this problem and will allow empty hash methods to pass.
    - You should still write a non-empty hash method that passes the test cases to ensure you get full credit.
  - WaterPouringPuzzle Classes (2)
  - WaterPouringPuzzle (2)
    - We will show what this animation looks like in lecture, since you might not be able to see the reference canvas until you write working classes.
Bonus: There are no bonus questions for this homework. You can work on TP0.