HW1 (due Sat. 21-Jan, 8pm)
From the syllabus:
Each CS Academy assignment has a required number of "stars" in several sections, listed like this:
"Section Exercises: ⭐
0 / 11."
Unless otherwise specified, each star is worth the same percentage of your homework score, up to 100%. If you complete fewer than the required number of stars in a section, you will receive a score equal to the percentage of required stars you completed. For example,
if there are 16 required stars and you complete 8, you will receive 50%. If you
complete all of the required stars you will receive 100% on the assignment. Each star you complete over the required number for that section is worth 0.5 percentage points of
bonus on the assignment. Thus, if there are 16 required stars and you complete 19, you will receive a 101.5% on the assignment.
Unless otherwise specified, bonus points cannot bring your score above a 105% per assignment. Stars from CTs are ineligible for bonus points.
A green checkmark next to a problem (in CS Academy) 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:
- Aside from problems we fully solve in lecture or recitation, homework is fully solo. You must not collaborate with anyone (besides current course TA's and faculty) in any way. See the syllabus for more details.
- Do not hardcode to the test cases in your solutions.
- As for exercises marked with ✓:
- We plan to cover these in lecture or recitation. You may take notes, and it is fine if your solution looks like ours, but we strongly discourage you from simply copying what we type. Instead, take notes on the approach and try to recreate the solution yourself.
- For the best learning experience, we recommend that you do not attempt these
exercises before we cover them in lecture or recitation.
- The problems with checkmarks are somewhat subject to change and lecture timing. Sometimes we may cover one or two more, or we may change which one we cover, but we will try not to.
- We will not grade your code for style this week.
- Do not use string indexing, loops, lists, list indexing, or recursion this week.
In CS Academy, complete the required number of stars from each section below.
For each section, we list the number of required and available stars. For example, this means 2 out of 4 stars are required from a section: "2/4 ⭐ required"
The number of stars available for each problem is in parentheses. For example, this means you get 2 stars for solving a problem: "(2)"
- Unit 1: Basic Programming Constructs
- 1.2.7 Code Tracing Exercises: 2/4 ⭐ required
- 1.3.10 Code Tracing Exercises: 2/4 ⭐ required
- 1.3.11 Guided Exercises: 2/2 ⭐ required
- ✓getKthDigit (1)
- ✓setKthDigit (1)
- 1.3.12 Section Exercises: 6/10 ⭐ required
- ✓distance (1)
- triangleArea (1)
- ✓howManyPizzas (1)
- leftoverPizzaSlices (1)
- ✓dotsOverlap (1)
- numberOfBricks (1)
- getGreen (2)
- isGray (2)
- 1.3.13 Honors Exercises: 3/6 ⭐ required
- blendColors (3)
- numberOfSteps (3)
- 1.4.9 Code Tracing Exercises: 1/2 ⭐ required
- 1.4.10 Guided Exercises: 2/2 ⭐ required
- ✓digitCount (1)
- closestEven (1)
- 1.4.11 Section Exercises: 4/8 ⭐ required
- ✓getGrade (1)
- getInRange (1)
- chicagoHour (1)
- dayOfWeek (1)
- ✓isDuplicatedNumber (2)
- areaWithinThreeLines (2)
- 1.4.12 Honors Exercises: 4/4 ⭐ required