Programming Readiness: Java Methods and Conditionals

This module supports R1, R2, and R6. All work here is formative. Pick Java or Python and stay with it.

Specification checklist

Traced/worked example

A plot can hold a flower only when it and both neighbors are 0. Missing neighbors at the ends count as 0.

static boolean canPlant(int prev, int curr, int next) {
    return curr == 0 && prev == 0 && next == 0;
}

canPlant(1, 0, 0) is false because the left neighbor is already planted. canPlant(0, 0, 0) is true.

For bed = {1, 0, 0, 0, 1} at index 1, prev is 1, so that plot cannot be planted even though it is empty.

Practice

Guided: Trace canPlant for (0,0,0), (1,0,0), (0,1,0), and (0,0,1).

Independent: Implement canPlant and canPlantAt. canPlantAt should read neighbors from the array and treat missing edges as 0.

Java: Practice.java, PracticeTest.java

javac Practice.java PracticeTest.java && java PracticeTest

Python: practice.py

python3 practice.py

Common mistakes

• Forgetting that an already filled plot (curr == 1) cannot be planted.
• Using bed[-1] or skipping the edge instead of treating a missing neighbor as 0.
• Checking only one side.

Exit guidance

Complete the self-check (Java or Python) and the starter tests, then explain one edge-plot decision in two sentences.

Return to Programming Readiness